Base | Representation |
---|---|
bin | 10001101000111100110… |
… | …100001110101101001101 |
3 | 11021212220101020022121221 |
4 | 101220330310032231031 |
5 | 124330041440232112 |
6 | 2324513312323341 |
7 | 153402321234313 |
oct | 21507464165515 |
9 | 4255811208557 |
10 | 1212201102157 |
11 | 428100a137a1 |
12 | 176b23843551 |
13 | 8a405301396 |
14 | 42956b340b3 |
15 | 217eae31e07 |
hex | 11a3cd0eb4d |
1212201102157 has 2 divisors, whose sum is σ = 1212201102158. Its totient is φ = 1212201102156.
The previous prime is 1212201102109. The next prime is 1212201102317. The reversal of 1212201102157 is 7512011022121.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 746877936841 + 465323165316 = 864221^2 + 682146^2 .
It is a cyclic number.
It is not a de Polignac number, because 1212201102157 - 219 = 1212200577869 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1212201102857) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 606100551078 + 606100551079.
It is an arithmetic number, because the mean of its divisors is an integer number (606100551079).
Almost surely, 21212201102157 is an apocalyptic number.
It is an amenable number.
1212201102157 is a deficient number, since it is larger than the sum of its proper divisors (1).
1212201102157 is an equidigital number, since it uses as much as digits as its factorization.
1212201102157 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 560, while the sum is 25.
Adding to 1212201102157 its reverse (7512011022121), we get a palindrome (8724212124278).
The spelling of 1212201102157 in words is "one trillion, two hundred twelve billion, two hundred one million, one hundred two thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •