Base | Representation |
---|---|
bin | 11101000111110000111… |
… | …000110111100101001000 |
3 | 21002022110011011202202120 |
4 | 131013300320313211020 |
5 | 230241430003412300 |
6 | 4131201131331240 |
7 | 264403426544532 |
oct | 35076070674510 |
9 | 7068404152676 |
10 | 2001201232200 |
11 | 701782a19375 |
12 | 283a1a2b0b20 |
13 | 11693539a661 |
14 | 6cc04220852 |
15 | 370c86ad3a0 |
hex | 1d1f0e37948 |
2001201232200 has 48 divisors (see below), whose sum is σ = 6203723821680. Its totient is φ = 533653661760.
The previous prime is 2001201232183. The next prime is 2001201232237. The reversal of 2001201232200 is 22321021002.
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 2001201232200.
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, 1667667094 + ... + 1667668293.
It is an arithmetic number, because the mean of its divisors is an integer number (129244246285).
Almost surely, 22001201232200 is an apocalyptic number.
2001201232200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2001201232200 is an abundant number, since it is smaller than the sum of its proper divisors (4202522589480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2001201232200 is a wasteful number, since it uses less digits than its factorization.
2001201232200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3335335406 (or 3335335397 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 15.
Adding to 2001201232200 its reverse (22321021002), we get a palindrome (2023522253202).
The spelling of 2001201232200 in words is "two trillion, one billion, two hundred one million, two hundred thirty-two thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •