Base | Representation |
---|---|
bin | 10001101000111101111… |
… | …100101111100101111101 |
3 | 11021212221201000002011122 |
4 | 101220331330233211331 |
5 | 124330111322024404 |
6 | 2324515232000325 |
7 | 153402641635331 |
oct | 21507574574575 |
9 | 4255851002148 |
10 | 1212220111229 |
11 | 428110717576 |
12 | 176b2a0900a5 |
13 | 8a40922875a |
14 | 429594817c1 |
15 | 217ec9393be |
hex | 11a3df2f97d |
1212220111229 has 2 divisors, whose sum is σ = 1212220111230. Its totient is φ = 1212220111228.
The previous prime is 1212220111217. The next prime is 1212220111231. The reversal of 1212220111229 is 9221110222121.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1212205404004 + 14707225 = 1101002^2 + 3835^2 .
It is a cyclic number.
It is not a de Polignac number, because 1212220111229 - 24 = 1212220111213 is a prime.
It is a Sophie Germain prime.
Together with 1212220111231, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1212220111198 and 1212220111207.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1212220111829) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 606110055614 + 606110055615.
It is an arithmetic number, because the mean of its divisors is an integer number (606110055615).
Almost surely, 21212220111229 is an apocalyptic number.
It is an amenable number.
1212220111229 is a deficient number, since it is larger than the sum of its proper divisors (1).
1212220111229 is an equidigital number, since it uses as much as digits as its factorization.
1212220111229 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 576, while the sum is 26.
The spelling of 1212220111229 in words is "one trillion, two hundred twelve billion, two hundred twenty million, one hundred eleven thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •