Base | Representation |
---|---|
bin | 10110110000110010101101… |
… | …000011000111010101101101 |
3 | 111010110102102002121211011021 |
4 | 112300302231003013111231 |
5 | 101110200240224310104 |
6 | 552525522150054141 |
7 | 30041465102250343 |
oct | 2660625503072555 |
9 | 433412362554137 |
10 | 100110001010029 |
11 | 2999745a78711a |
12 | b289ba494a351 |
13 | 43b24429077aa |
14 | 1aa14c81b9993 |
15 | b89156a16754 |
hex | 5b0cad0c756d |
100110001010029 has 2 divisors, whose sum is σ = 100110001010030. Its totient is φ = 100110001010028.
The previous prime is 100110001010003. The next prime is 100110001010167. The reversal of 100110001010029 is 920010100011001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 83955107940804 + 16154893069225 = 9162702^2 + 4019315^2 .
It is an emirp because it is prime and its reverse (920010100011001) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 100110001010029 - 217 = 100110000878957 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 100110001009994 and 100110001010021.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100110001010729) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50055000505014 + 50055000505015.
It is an arithmetic number, because the mean of its divisors is an integer number (50055000505015).
Almost surely, 2100110001010029 is an apocalyptic number.
It is an amenable number.
100110001010029 is a deficient number, since it is larger than the sum of its proper divisors (1).
100110001010029 is an equidigital number, since it uses as much as digits as its factorization.
100110001010029 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 18, while the sum is 16.
The spelling of 100110001010029 in words is "one hundred trillion, one hundred ten billion, one million, ten thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •