Base | Representation |
---|---|
bin | 100000000010000111110… |
… | …100110001000100101000 |
3 | 21210102221112002121102120 |
4 | 200002013310301010220 |
5 | 242031231303342300 |
6 | 4403133021431240 |
7 | 315016213243014 |
oct | 40020764610450 |
9 | 7712845077376 |
10 | 2201302012200 |
11 | 779626664025 |
12 | 2b676370b520 |
13 | 12c774544365 |
14 | 78787857544 |
15 | 3c3da8dd3a0 |
hex | 20087d31128 |
2201302012200 has 48 divisors (see below), whose sum is σ = 6824036239680. Its totient is φ = 587013869760.
The previous prime is 2201302012183. The next prime is 2201302012219. The reversal of 2201302012200 is 22102031022.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 2201302012200.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1834417744 + ... + 1834418943.
It is an arithmetic number, because the mean of its divisors is an integer number (142167421660).
Almost surely, 22201302012200 is an apocalyptic number.
2201302012200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2201302012200 is an abundant number, since it is smaller than the sum of its proper divisors (4622734227480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2201302012200 is a wasteful number, since it uses less digits than its factorization.
2201302012200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3668836706 (or 3668836697 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 15.
Adding to 2201302012200 its reverse (22102031022), we get a palindrome (2223404043222).
The spelling of 2201302012200 in words is "two trillion, two hundred one billion, three hundred two million, twelve thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •