Base | Representation |
---|---|
bin | 1001000110101011010100… |
… | …0101110100011000000101 |
3 | 1022102222100212002011220102 |
4 | 2101222311011310120011 |
5 | 2303002104333013104 |
6 | 33142401315013445 |
7 | 2052135602041244 |
oct | 221526505643005 |
9 | 38388325064812 |
10 | 10010312001029 |
11 | 320a39317a01a |
12 | 115809529a285 |
13 | 577c78686092 |
14 | 2687048aa95b |
15 | 1255d03d0a1e |
hex | 91ab5174605 |
10010312001029 has 2 divisors, whose sum is σ = 10010312001030. Its totient is φ = 10010312001028.
The previous prime is 10010312001017. The next prime is 10010312001101. The reversal of 10010312001029 is 92010021301001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6639408657025 + 3370903344004 = 2576705^2 + 1836002^2 .
It is a cyclic number.
It is not a de Polignac number, because 10010312001029 - 216 = 10010311935493 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10010312001029.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10010312001229) 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, 5005156000514 + 5005156000515.
It is an arithmetic number, because the mean of its divisors is an integer number (5005156000515).
Almost surely, 210010312001029 is an apocalyptic number.
It is an amenable number.
10010312001029 is a deficient number, since it is larger than the sum of its proper divisors (1).
10010312001029 is an equidigital number, since it uses as much as digits as its factorization.
10010312001029 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 20.
The spelling of 10010312001029 in words is "ten trillion, ten billion, three hundred twelve million, one thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •