Base | Representation |
---|---|
bin | 1001000110101110010010… |
… | …1110001001001001100101 |
3 | 1022110001102112201200000201 |
4 | 2101223210232021021211 |
5 | 2303010223420213104 |
6 | 33143012502310501 |
7 | 2052164444215663 |
oct | 221534456111145 |
9 | 38401375650021 |
10 | 10011111101029 |
11 | 320a763255745 |
12 | 1158278a28431 |
13 | 5780750b240c |
14 | 26877ca7dc33 |
15 | 12562a62b0a4 |
hex | 91ae4b89265 |
10011111101029 has 2 divisors, whose sum is σ = 10011111101030. Its totient is φ = 10011111101028.
The previous prime is 10011111100993. The next prime is 10011111101053. The reversal of 10011111101029 is 92010111111001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5640197508100 + 4370913592929 = 2374910^2 + 2090673^2 .
It is an emirp because it is prime and its reverse (92010111111001) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10011111101029 - 211 = 10011111098981 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10011111100997 and 10011111101015.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10011111101429) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5005555550514 + 5005555550515.
It is an arithmetic number, because the mean of its divisors is an integer number (5005555550515).
Almost surely, 210011111101029 is an apocalyptic number.
It is an amenable number.
10011111101029 is a deficient number, since it is larger than the sum of its proper divisors (1).
10011111101029 is an equidigital number, since it uses as much as digits as its factorization.
10011111101029 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 19.
The spelling of 10011111101029 in words is "ten trillion, eleven billion, one hundred eleven million, one hundred one thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •