WordGPT

The number 25291

25291 is a composite number with 4 divisors. Its prime factorisation is 7 × 3613. Divisors (4): 1, 7, 3613, 25291.

Number

Pick any whole number from 1 to 100,000.

How to work it out

  1. 1

    What is special about 25291: a semiprime: 7 × 3613, the product of two primes.

  2. 2

    25291 is composite. Its prime factorisation is

    25291=7×361325291 = 7 \times 3613
  3. 3

    The divisors add up to 28912; without 25291 itself that is 3621, so 25291 is deficient (3621 is less than 25291). Euler's totient φ(25291) = 21672 numbers up to 25291 share no factor with it.

  4. 4

    The digits of 25291 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 56 steps to reach 1.

LaTeX source of the formulas on this page
\[ 25291 = 7 \times 3613 \]

25291 at a glance

PropertyValue
Typecomposite
Number of divisors4
Sum of divisors28912
Euler totient φ(n)21672
Square639634681
Cube16177000717171
Square root159.031443
Digit sum / digital root19 / 1
Collatz steps to 156
Scientific notation2.5291 × 10410^{4}

25291 in other forms

FormValue
In wordstwenty-five thousand two hundred and ninety-one
Binary (base 2)110001011001011
Octal (base 8)61313
Hexadecimal (base 16)62CB
Base 31021200201
As time25291 seconds = 7 h 1 min 31 s

Is 25291 divisible by 2 to 12?

DivisorAnswerRule
2No (remainder 1)A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8).
3No (remainder 1)A number is divisible by 3 if the digits add up to a multiple of 3.
4No (remainder 3)A number is divisible by 4 if the last two digits make a multiple of 4.
5No (remainder 1)A number is divisible by 5 if the last digit is 0 or 5.
6No (remainder 1)A number is divisible by 6 if it is divisible by both 2 and 3.
7Yes (25291 ÷ 7 = 3613)A number is divisible by 7 if double the last digit and subtract it from the rest: the result is a multiple of 7.
8No (remainder 3)A number is divisible by 8 if the last three digits make a multiple of 8.
9No (remainder 1)A number is divisible by 9 if the digits add up to a multiple of 9.
10No (remainder 1)A number is divisible by 10 if the last digit is 0.
11No (remainder 2)A number is divisible by 11 if the alternating sum of the digits is a multiple of 11.
12No (remainder 7)A number is divisible by 12 if it is divisible by both 3 and 4.

Questions

Is 25291 a prime number?

No. 25291 = 7 × 3613, so it is divisible by 7.

What are the factors of 25291?

1, 7, 3613, 25291.

What is 25291 in binary?

110001011001011 (hexadecimal 62CB, octal 61313).

What is the square root of 25291?

About 159.0314.

Is 25291 divisible by 3?

No. Its digits add up to 19, which is not a multiple of 3.

What is special about the number 25291?

25291 is a semiprime: 7 × 3613, the product of two primes.

Find the next one

Nearby numbers

    25291: is it prime? Factors, square root, binary, Roman numeral | WordGPT