Base | Representation |
---|---|
bin | 10001100111000000110… |
… | …010001111111010011101 |
3 | 11021200112100122221112001 |
4 | 101213000302033322131 |
5 | 124311311233124104 |
6 | 2323531015442301 |
7 | 153266623023505 |
oct | 21470062177235 |
9 | 4250470587461 |
10 | 1210120208029 |
11 | 427233345187 |
12 | 176642986391 |
13 | 8a163172995 |
14 | 427da61ca05 |
15 | 217283e0aa4 |
hex | 119c0c8fe9d |
1210120208029 has 2 divisors, whose sum is σ = 1210120208030. Its totient is φ = 1210120208028.
The previous prime is 1210120208027. The next prime is 1210120208051. The reversal of 1210120208029 is 9208020210121.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 661042172025 + 549078036004 = 813045^2 + 740998^2 .
It is an emirp because it is prime and its reverse (9208020210121) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1210120208029 - 21 = 1210120208027 is a prime.
Together with 1210120208027, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 1210120207988 and 1210120208006.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1210120208027) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 605060104014 + 605060104015.
It is an arithmetic number, because the mean of its divisors is an integer number (605060104015).
Almost surely, 21210120208029 is an apocalyptic number.
It is an amenable number.
1210120208029 is a deficient number, since it is larger than the sum of its proper divisors (1).
1210120208029 is an equidigital number, since it uses as much as digits as its factorization.
1210120208029 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1152, while the sum is 28.
The spelling of 1210120208029 in words is "one trillion, two hundred ten billion, one hundred twenty million, two hundred eight thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •