Base | Representation |
---|---|
bin | 1001001011111001110011… |
… | …1000010001101010110101 |
3 | 1022202120010100020202120222 |
4 | 2102332130320101222311 |
5 | 2310440001112023104 |
6 | 33251531045504125 |
7 | 2061464616266555 |
oct | 222763470215265 |
9 | 38676110222528 |
10 | 10100100111029 |
11 | 3244479227005 |
12 | 1171573112045 |
13 | 58358761a156 |
14 | 26cbc15ad165 |
15 | 127ad7d551be |
hex | 92f9ce11ab5 |
10100100111029 has 2 divisors, whose sum is σ = 10100100111030. Its totient is φ = 10100100111028.
The previous prime is 10100100110993. The next prime is 10100100111103. The reversal of 10100100111029 is 92011100100101.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10097287930129 + 2812180900 = 3177623^2 + 53030^2 .
It is a cyclic number.
It is not a de Polignac number, because 10100100111029 - 28 = 10100100110773 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10100100110998 and 10100100111016.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10100100111529) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5050050055514 + 5050050055515.
It is an arithmetic number, because the mean of its divisors is an integer number (5050050055515).
Almost surely, 210100100111029 is an apocalyptic number.
It is an amenable number.
10100100111029 is a deficient number, since it is larger than the sum of its proper divisors (1).
10100100111029 is an equidigital number, since it uses as much as digits as its factorization.
10100100111029 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18, while the sum is 17.
The spelling of 10100100111029 in words is "ten trillion, one hundred billion, one hundred million, one hundred eleven thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •