Base | Representation |
---|---|
bin | 1010000000010100011100… |
… | …10100011001011110010000 |
3 | 2212220021222011111222200010 |
4 | 11000022032110121132100 |
5 | 10340431434302431000 |
6 | 114443114425554520 |
7 | 4430351333045451 |
oct | 500121624313620 |
9 | 85807864458603 |
10 | 22001210202000 |
11 | 701272a652567 |
12 | 2573b94945a40 |
13 | c379224a2063 |
14 | 560c15735128 |
15 | 28247e216d50 |
hex | 14028e519790 |
22001210202000 has 80 divisors (see below), whose sum is σ = 70931901710592. Its totient is φ = 5866989385600.
The previous prime is 22001210201981. The next prime is 22001210202031. The reversal of 22001210202000 is 20201210022.
It is a tau number, because it is divible by the number of its divisors (80).
It is a Harshad number since it is a multiple of its sum of digits (12).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1833428184 + ... + 1833440183.
Almost surely, 222001210202000 is an apocalyptic number.
22001210202000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
22001210202000 is an abundant number, since it is smaller than the sum of its proper divisors (48930691508592).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22001210202000 is a wasteful number, since it uses less digits than its factorization.
22001210202000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3666868393 (or 3666868377 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 12.
Adding to 22001210202000 its reverse (20201210022), we get a palindrome (22021411412022).
The spelling of 22001210202000 in words is "twenty-two trillion, one billion, two hundred ten million, two hundred two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •