Base | Representation |
---|---|
bin | 10111100100110111… |
… | …111110111111001000 |
3 | 2102100020002220020211 |
4 | 113210313332333020 |
5 | 403321031431030 |
6 | 15343542130504 |
7 | 1554215356342 |
oct | 274467767710 |
9 | 72306086224 |
10 | 25314717640 |
11 | a810553053 |
12 | 4aa5a20a34 |
13 | 25057b8284 |
14 | 13220ac292 |
15 | 9d263c12a |
hex | 5e4dfefc8 |
25314717640 has 32 divisors (see below), whose sum is σ = 59955912000. Its totient is φ = 9592945344.
The previous prime is 25314717563. The next prime is 25314717641. The reversal of 25314717640 is 4671741352.
It is a Harshad number since it is a multiple of its sum of digits (40).
It is a junction number, because it is equal to n+sod(n) for n = 25314717593 and 25314717602.
It is not an unprimeable number, because it can be changed into a prime (25314717641) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 16653660 + ... + 16655179.
It is an arithmetic number, because the mean of its divisors is an integer number (1873622250).
Almost surely, 225314717640 is an apocalyptic number.
25314717640 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
25314717640 is an abundant number, since it is smaller than the sum of its proper divisors (34641194360).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
25314717640 is a wasteful number, since it uses less digits than its factorization.
25314717640 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33308869 (or 33308865 counting only the distinct ones).
The product of its (nonzero) digits is 141120, while the sum is 40.
The spelling of 25314717640 in words is "twenty-five billion, three hundred fourteen million, seven hundred seventeen thousand, six hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •