Base | Representation |
---|---|
bin | 10001101000000001010… |
… | …001101110011010000100 |
3 | 11021210022202121220010221 |
4 | 101220001101232122010 |
5 | 124321020230414340 |
6 | 2324230230354124 |
7 | 153335501561554 |
oct | 21500121563204 |
9 | 4253282556127 |
10 | 1211202201220 |
11 | 427739080730 |
12 | 1768a51bb944 |
13 | 8a2a638a53b |
14 | 428a01d1164 |
15 | 2178d3bb44a |
hex | 11a0146e684 |
1211202201220 has 48 divisors (see below), whose sum is σ = 2775097838016. Its totient is φ = 440382608000.
The previous prime is 1211202201211. The next prime is 1211202201227. The reversal of 1211202201220 is 221022021121.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 1211202201194 and 1211202201203.
It is not an unprimeable number, because it can be changed into a prime (1211202201227) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1460730 + ... + 2134510.
It is an arithmetic number, because the mean of its divisors is an integer number (57814538292).
Almost surely, 21211202201220 is an apocalyptic number.
1211202201220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1211202201220 is an abundant number, since it is smaller than the sum of its proper divisors (1563895636796).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1211202201220 is a wasteful number, since it uses less digits than its factorization.
1211202201220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 681972 (or 681970 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 1211202201220 its reverse (221022021121), we get a palindrome (1432224222341).
The spelling of 1211202201220 in words is "one trillion, two hundred eleven billion, two hundred two million, two hundred one thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •