Base | Representation |
---|---|
bin | 10001011111100000000… |
… | …111110100100001110001 |
3 | 11020220201100110212010012 |
4 | 101133200013310201301 |
5 | 124143302320202004 |
6 | 2320114504144305 |
7 | 152563032413444 |
oct | 21374007644161 |
9 | 4226640425105 |
10 | 1202056022129 |
11 | 423875317a36 |
12 | 174b72168095 |
13 | 89479548551 |
14 | 4227360765b |
15 | 2140546746e |
hex | 117e01f4871 |
1202056022129 has 2 divisors, whose sum is σ = 1202056022130. Its totient is φ = 1202056022128.
The previous prime is 1202056022119. The next prime is 1202056022131. The reversal of 1202056022129 is 9212206502021.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 829165042225 + 372890979904 = 910585^2 + 610648^2 .
It is a cyclic number.
It is not a de Polignac number, because 1202056022129 - 228 = 1201787586673 is a prime.
Together with 1202056022131, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 1202056022095 and 1202056022104.
It is not a weakly prime, because it can be changed into another prime (1202056022119) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 601028011064 + 601028011065.
It is an arithmetic number, because the mean of its divisors is an integer number (601028011065).
Almost surely, 21202056022129 is an apocalyptic number.
It is an amenable number.
1202056022129 is a deficient number, since it is larger than the sum of its proper divisors (1).
1202056022129 is an equidigital number, since it uses as much as digits as its factorization.
1202056022129 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8640, while the sum is 32.
The spelling of 1202056022129 in words is "one trillion, two hundred two billion, fifty-six million, twenty-two thousand, one hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •