Base | Representation |
---|---|
bin | 1001000101010101010… |
… | …11010010100000011101 |
3 | 1002211120212022121200211 |
4 | 10202222223102200131 |
5 | 20103140341320104 |
6 | 355213254052421 |
7 | 31356104514556 |
oct | 4425253224035 |
9 | 1084525277624 |
10 | 312101120029 |
11 | 1103a7a44946 |
12 | 505a204a111 |
13 | 2357ac0996a |
14 | 1116a36332d |
15 | 81b9c55e04 |
hex | 48aaad281d |
312101120029 has 2 divisors, whose sum is σ = 312101120030. Its totient is φ = 312101120028.
The previous prime is 312101120017. The next prime is 312101120083. The reversal of 312101120029 is 920021101213.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 238226967225 + 73874152804 = 488085^2 + 271798^2 .
It is an emirp because it is prime and its reverse (920021101213) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 312101120029 - 27 = 312101119901 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 312101119991 and 312101120009.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (312101120629) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 156050560014 + 156050560015.
It is an arithmetic number, because the mean of its divisors is an integer number (156050560015).
Almost surely, 2312101120029 is an apocalyptic number.
It is an amenable number.
312101120029 is a deficient number, since it is larger than the sum of its proper divisors (1).
312101120029 is an equidigital number, since it uses as much as digits as its factorization.
312101120029 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 22.
The spelling of 312101120029 in words is "three hundred twelve billion, one hundred one million, one hundred twenty thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.118 sec. • engine limits •