Base | Representation |
---|---|
bin | 10001101000111101111… |
… | …101001010101010101001 |
3 | 11021212221201012201021202 |
4 | 101220331331022222221 |
5 | 124330111334101441 |
6 | 2324515234213545 |
7 | 153402642606536 |
oct | 21507575125251 |
9 | 4255851181252 |
10 | 1212220222121 |
11 | 428110792917 |
12 | 176b2a1242b5 |
13 | 8a40926707c |
14 | 429594add8d |
15 | 217ec95c19b |
hex | 11a3df4aaa9 |
1212220222121 has 8 divisors (see below), whose sum is σ = 1246368818688. Its totient is φ = 1178289828000.
The previous prime is 1212220222013. The next prime is 1212220222133.
1212220222121 is nontrivially palindromic in base 10.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1212220222121 - 234 = 1195040352937 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1212220222093 and 1212220222102.
It is not an unprimeable number, because it can be changed into a prime (1212220222921) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 54539345 + ... + 54561566.
It is an arithmetic number, because the mean of its divisors is an integer number (155796102336).
Almost surely, 21212220222121 is an apocalyptic number.
It is an amenable number.
1212220222121 is a deficient number, since it is larger than the sum of its proper divisors (34148596567).
1212220222121 is a wasteful number, since it uses less digits than its factorization.
1212220222121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 109101223.
The product of its (nonzero) digits is 256, while the sum is 20.
It can be divided in two parts, 1212220 and 222121, that added together give a palindrome (1434341).
The spelling of 1212220222121 in words is "one trillion, two hundred twelve billion, two hundred twenty million, two hundred twenty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •