Base | Representation |
---|---|
bin | 10010110111001010… |
… | …101111001000011000 |
3 | 1221021110102122022100 |
4 | 102313022233020120 |
5 | 312434221223300 |
6 | 13145402123400 |
7 | 1314612634041 |
oct | 226712571030 |
9 | 57243378270 |
10 | 20252914200 |
11 | 8653273222 |
12 | 3b127b0560 |
13 | 1ba9bca8cc |
14 | da1b1d8c8 |
15 | 7d8078700 |
hex | 4b72af218 |
20252914200 has 144 divisors (see below), whose sum is σ = 68373302400. Its totient is φ = 5372409600.
The previous prime is 20252914163. The next prime is 20252914259. The reversal of 20252914200 is 241925202.
It is a happy number.
It is a congruent number.
It is an unprimeable number.
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 35 ways as a sum of consecutive naturals, for example, 314346 + ... + 373254.
It is an arithmetic number, because the mean of its divisors is an integer number (474814600).
Almost surely, 220252914200 is an apocalyptic number.
20252914200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 20252914200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (34186651200).
20252914200 is an abundant number, since it is smaller than the sum of its proper divisors (48120388200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20252914200 is a wasteful number, since it uses less digits than its factorization.
20252914200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 59122 (or 59110 counting only the distinct ones).
The product of its (nonzero) digits is 2880, while the sum is 27.
The spelling of 20252914200 in words is "twenty billion, two hundred fifty-two million, nine hundred fourteen thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •