Base | Representation |
---|---|
bin | 10001110001001111010… |
… | …011011111000010101100 |
3 | 11022201212122101011002120 |
4 | 101301033103133002230 |
5 | 130001303403020022 |
6 | 2332544404552540 |
7 | 154136012053632 |
oct | 21611723370254 |
9 | 4281778334076 |
10 | 1221101220012 |
11 | 430958893aa3 |
12 | 1787a83b2750 |
13 | 8b1c317c6cb |
14 | 4315cb89352 |
15 | 21b6c47dd5c |
hex | 11c4f4df0ac |
1221101220012 has 48 divisors (see below), whose sum is σ = 2927611606752. Its totient is φ = 395847544320.
The previous prime is 1221101220011. The next prime is 1221101220037. The reversal of 1221101220012 is 2100221011221.
It is a junction number, because it is equal to n+sod(n) for n = 1221101219973 and 1221101220000.
It is not an unprimeable number, because it can be changed into a prime (1221101220011) 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, 308328 + ... + 1592880.
It is an arithmetic number, because the mean of its divisors is an integer number (60991908474).
Almost surely, 21221101220012 is an apocalyptic number.
1221101220012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1221101220012 is an abundant number, since it is smaller than the sum of its proper divisors (1706510386740).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1221101220012 is a wasteful number, since it uses less digits than its factorization.
1221101220012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1286738 (or 1286736 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 1221101220012 its reverse (2100221011221), we get a palindrome (3321322231233).
The spelling of 1221101220012 in words is "one trillion, two hundred twenty-one billion, one hundred one million, two hundred twenty thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •