Base | Representation |
---|---|
bin | 110000111001… |
… | …1111111110011 |
3 | 1210020200202201 |
4 | 1201303333303 |
5 | 23031002242 |
6 | 2313324031 |
7 | 430641643 |
oct | 141637763 |
9 | 53220681 |
10 | 25640947 |
11 | 13523472 |
12 | 8706617 |
13 | 5409b77 |
14 | 3596523 |
15 | 23b74b7 |
hex | 1873ff3 |
25640947 has 10 divisors (see below), whose sum is σ = 27332228. Its totient is φ = 24054048.
The previous prime is 25640939. The next prime is 25640957. The reversal of 25640947 is 74904652.
It is not a de Polignac number, because 25640947 - 23 = 25640939 is a prime.
It is a Duffinian number.
It is a zygodrome in base 2.
It is not an unprimeable number, because it can be changed into a prime (25640957) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 83368 + ... + 83674.
Almost surely, 225640947 is an apocalyptic number.
25640947 is a deficient number, since it is larger than the sum of its proper divisors (1691281).
25640947 is an frugal number, since it uses more digits than its factorization.
25640947 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 375 (or 324 counting only the distinct ones).
The product of its (nonzero) digits is 60480, while the sum is 37.
The square root of 25640947 is about 5063.6890702333. The cubic root of 25640947 is about 294.8795716426.
The spelling of 25640947 in words is "twenty-five million, six hundred forty thousand, nine hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •