Base | Representation |
---|---|
bin | 1011101101100010000… |
… | …0111110110001100000 |
3 | 201020100001012211012122 |
4 | 2323120200332301200 |
5 | 11244024430120000 |
6 | 232232552043412 |
7 | 20351643311021 |
oct | 2733040766140 |
9 | 636301184178 |
10 | 201201020000 |
11 | 78368804312 |
12 | 32bb1993568 |
13 | 15c860ac9b6 |
14 | 9a497d8c48 |
15 | 5378b12085 |
hex | 2ed883ec60 |
201201020000 has 240 divisors, whose sum is σ = 504015063552. Its totient is φ = 79027200000.
The previous prime is 201201019969. The next prime is 201201020029. The reversal of 201201020000 is 20102102.
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 201201020000.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 287019650 + ... + 287020350.
Almost surely, 2201201020000 is an apocalyptic number.
201201020000 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 201201020000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (252007531776).
201201020000 is an abundant number, since it is smaller than the sum of its proper divisors (302814043552).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201201020000 is a wasteful number, since it uses less digits than its factorization.
201201020000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 971 (or 948 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 8.
Adding to 201201020000 its reverse (20102102), we get a palindrome (201221122102).
The spelling of 201201020000 in words is "two hundred one billion, two hundred one million, twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •