Base | Representation |
---|---|
bin | 1011000111011011010010… |
… | …0110110001111101101001 |
3 | 1121021102122222012102102211 |
4 | 2301312310212301331221 |
5 | 3100222042234201441 |
6 | 41554450124525121 |
7 | 2401011544023343 |
oct | 261666446617551 |
9 | 47242588172384 |
10 | 12222212022121 |
11 | 3992458065a82 |
12 | 14548b60b07a1 |
13 | 6a871b7670ca |
14 | 3037b5a72293 |
15 | 162ddb404a81 |
hex | b1db49b1f69 |
12222212022121 has 8 divisors (see below), whose sum is σ = 12304963347264. Its totient is φ = 12139484506800.
The previous prime is 12222212022029. The next prime is 12222212022157. The reversal of 12222212022121 is 12122021222221.
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 12222212022121 - 233 = 12213622087529 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12222212022092 and 12222212022101.
It is not an unprimeable number, because it can be changed into a prime (12222212052121) 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, 4921726 + ... + 6976231.
It is an arithmetic number, because the mean of its divisors is an integer number (1538120418408).
Almost surely, 212222212022121 is an apocalyptic number.
It is an amenable number.
12222212022121 is a deficient number, since it is larger than the sum of its proper divisors (82751325143).
12222212022121 is a wasteful number, since it uses less digits than its factorization.
12222212022121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11904911.
The product of its (nonzero) digits is 512, while the sum is 22.
Adding to 12222212022121 its reverse (12122021222221), we get a palindrome (24344233244342).
The spelling of 12222212022121 in words is "twelve trillion, two hundred twenty-two billion, two hundred twelve million, twenty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •