Base | Representation |
---|---|
bin | 1011000110110110000001… |
… | …1111111111000101011001 |
3 | 1121020110211222112212211100 |
4 | 2301231200133333011121 |
5 | 3100041102010120441 |
6 | 41550113504422013 |
7 | 2400205654636200 |
oct | 261554037770531 |
9 | 47213758485740 |
10 | 12212211020121 |
11 | 3989195827172 |
12 | 1452984917909 |
13 | 6a77b67b8848 |
14 | 30310772c237 |
15 | 162a033e9cb6 |
hex | b1b607ff159 |
12212211020121 has 72 divisors (see below), whose sum is σ = 21501598659840. Its totient is φ = 6647067149184.
The previous prime is 12212211020117. The next prime is 12212211020123. The reversal of 12212211020121 is 12102011221221.
12212211020121 is a `hidden beast` number, since 1 + 221 + 221 + 1 + 0 + 201 + 21 = 666.
It is not a de Polignac number, because 12212211020121 - 22 = 12212211020117 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12212211020094 and 12212211020103.
It is not an unprimeable number, because it can be changed into a prime (12212211020123) by changing a digit.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 94660 + ... + 4943013.
It is an arithmetic number, because the mean of its divisors is an integer number (298633314720).
Almost surely, 212212211020121 is an apocalyptic number.
It is an amenable number.
12212211020121 is a deficient number, since it is larger than the sum of its proper divisors (9289387639719).
12212211020121 is a wasteful number, since it uses less digits than its factorization.
12212211020121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5037955 (or 5037945 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 18.
Adding to 12212211020121 its reverse (12102011221221), we get a palindrome (24314222241342).
The spelling of 12212211020121 in words is "twelve trillion, two hundred twelve billion, two hundred eleven million, twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •