Base | Representation |
---|---|
bin | 110000101001… |
… | …0001111000101 |
3 | 1202222200002000 |
4 | 1201102033011 |
5 | 23012041121 |
6 | 2310335513 |
7 | 426524532 |
oct | 141221705 |
9 | 52880060 |
10 | 25502661 |
11 | 13439588 |
12 | 865a599 |
13 | 538bc42 |
14 | 355bd89 |
15 | 238b526 |
hex | 18523c5 |
25502661 has 8 divisors (see below), whose sum is σ = 37781760. Its totient is φ = 17001756.
The previous prime is 25502651. The next prime is 25502671. The reversal of 25502661 is 16620552.
It is an interprime number because it is at equal distance from previous prime (25502651) and next prime (25502671).
It is not a de Polignac number, because 25502661 - 26 = 25502597 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27), and also a Moran number because the ratio is a prime number: 944543 = 25502661 / (2 + 5 + 5 + 0 + 2 + 6 + 6 + 1).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (25502611) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 472245 + ... + 472298.
It is an arithmetic number, because the mean of its divisors is an integer number (4722720).
Almost surely, 225502661 is an apocalyptic number.
It is an amenable number.
25502661 is a deficient number, since it is larger than the sum of its proper divisors (12279099).
25502661 is an equidigital number, since it uses as much as digits as its factorization.
25502661 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 944552 (or 944546 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 27.
The square root of 25502661 is about 5050.0159405689. The cubic root of 25502661 is about 294.3485038426.
The spelling of 25502661 in words is "twenty-five million, five hundred two thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •