Base | Representation |
---|---|
bin | 1011101110110110100… |
… | …0000100100000000000 |
3 | 201021020201200000211102 |
4 | 2323231220010200000 |
5 | 11300241112400000 |
6 | 232332043233532 |
7 | 20363503634540 |
oct | 2735550044000 |
9 | 637221600742 |
10 | 201555200000 |
11 | 7852a723a60 |
12 | 330905188a8 |
13 | 1601159a66b |
14 | 9a80873320 |
15 | 5399c743d5 |
hex | 2eeda04800 |
201555200000 has 576 divisors, whose sum is σ = 629565955200. Its totient is φ = 62668800000.
The previous prime is 201555199997. The next prime is 201555200023. The reversal of 201555200000 is 2555102.
It is a Harshad number since it is a multiple of its sum of digits (20).
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, 492799796 + ... + 492800204.
It is an arithmetic number, because the mean of its divisors is an integer number (1092996450).
Almost surely, 2201555200000 is an apocalyptic number.
201555200000 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 201555200000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (314782977600).
201555200000 is an abundant number, since it is smaller than the sum of its proper divisors (428010755200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201555200000 is an frugal number, since it uses more digits than its factorization.
201555200000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 474 (or 434 counting only the distinct ones).
The product of its (nonzero) digits is 500, while the sum is 20.
Adding to 201555200000 its reverse (2555102), we get a palindrome (201557755102).
The spelling of 201555200000 in words is "two hundred one billion, five hundred fifty-five million, two hundred thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •