Base | Representation |
---|---|
bin | 10010110100011001… |
… | …011000111000110000 |
3 | 1221011012221200012021 |
4 | 102310121120320300 |
5 | 312340321023400 |
6 | 13141021441224 |
7 | 1313506523656 |
oct | 226431307060 |
9 | 57135850167 |
10 | 20206423600 |
11 | 8629aaa140 |
12 | 3abb110214 |
13 | 1ba03a098c |
14 | d9989add6 |
15 | 7d3e4371a |
hex | 4b4658e30 |
20206423600 has 240 divisors, whose sum is σ = 54837427680. Its totient is φ = 7091200000.
The previous prime is 20206423577. The next prime is 20206423619. The reversal of 20206423600 is 632460202.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 18219846 + ... + 18220954.
It is an arithmetic number, because the mean of its divisors is an integer number (228489282).
Almost surely, 220206423600 is an apocalyptic number.
20206423600 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 20206423600, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (27418713840).
20206423600 is an abundant number, since it is smaller than the sum of its proper divisors (34631004080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20206423600 is a wasteful number, since it uses less digits than its factorization.
20206423600 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1280 (or 1269 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 25.
Adding to 20206423600 its reverse (632460202), we get a palindrome (20838883802).
The spelling of 20206423600 in words is "twenty billion, two hundred six million, four hundred twenty-three thousand, six hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •