Base | Representation |
---|---|
bin | 101111000010000100… |
… | …1011011011100011101 |
3 | 100122200221210021010102 |
4 | 1132010021123130131 |
5 | 3123322313441104 |
6 | 114222132350445 |
7 | 10203622662362 |
oct | 1360411333435 |
9 | 318627707112 |
10 | 101001312029 |
11 | 3991a675702 |
12 | 176a9175425 |
13 | 96a80b8b77 |
14 | 4c62030469 |
15 | 29620c9a1e |
hex | 178425b71d |
101001312029 has 2 divisors, whose sum is σ = 101001312030. Its totient is φ = 101001312028.
The previous prime is 101001312019. The next prime is 101001312037. The reversal of 101001312029 is 920213100101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 92954863225 + 8046448804 = 304885^2 + 89702^2 .
It is an emirp because it is prime and its reverse (920213100101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 101001312029 - 28 = 101001311773 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 101001312029.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101001312019) 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, 50500656014 + 50500656015.
It is an arithmetic number, because the mean of its divisors is an integer number (50500656015).
Almost surely, 2101001312029 is an apocalyptic number.
It is an amenable number.
101001312029 is a deficient number, since it is larger than the sum of its proper divisors (1).
101001312029 is an equidigital number, since it uses as much as digits as its factorization.
101001312029 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 101001312029 in words is "one hundred one billion, one million, three hundred twelve thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •