| Base | Representation |
|---|---|
| bin | 101101101100111100110001… |
| … | …110111001000000011100000 |
| 3 | 222100200111202001110121202122 |
| 4 | 231230330301313020003200 |
| 5 | 202321200032310120000 |
| 6 | 1551254331213403412 |
| 7 | 60223562300512652 |
| oct | 5554746167100340 |
| 9 | 870614661417678 |
| 10 | 201001011020000 |
| 11 | 590550606a9564 |
| 12 | 1a663413a99568 |
| 13 | 8820410b527b9 |
| 14 | 378c7024466d2 |
| 15 | 183876e462085 |
| hex | b6cf31dc80e0 |
201001011020000 has 240 divisors, whose sum is σ = 525672315075600. Its totient is φ = 75414643200000.
The previous prime is 201001011019997. The next prime is 201001011020039. The reversal of 201001011020000 is 20110100102.
It is a super-2 number, since 2×2010010110200002 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (8).
It is a self number, because there is not a number n which added to its sum of digits gives 201001011020000.
It is a congruent number.
It is an unprimeable number.
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 39 ways as a sum of consecutive naturals, for example, 35761436 + ... + 40998564.
It is an arithmetic number, because the mean of its divisors is an integer number (2190301312815).
Almost surely, 2201001011020000 is an apocalyptic number.
201001011020000 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 201001011020000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (262836157537800).
201001011020000 is an abundant number, since it is smaller than the sum of its proper divisors (324671304055600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201001011020000 is a wasteful number, since it uses less digits than its factorization.
201001011020000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5237279 (or 5237256 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 8.
Adding to 201001011020000 its reverse (20110100102), we get a palindrome (201021121120102).
The spelling of 201001011020000 in words is "two hundred one trillion, one billion, eleven million, twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.110 sec. • engine limits •