Base | Representation |
---|---|
bin | 10110101111010101100101… |
… | …000111101011111011011101 |
3 | 111010002212022112220021100211 |
4 | 112233111211013223323131 |
5 | 101102031000030013432 |
6 | 552411544143452421 |
7 | 30031325164560046 |
oct | 2657254507537335 |
9 | 433085275807324 |
10 | 100010010001117 |
11 | 29959009432177 |
12 | b272739bb7111 |
13 | 43a5b98c25628 |
14 | 1a9a7204198cd |
15 | b867534a5d47 |
hex | 5af5651ebedd |
100010010001117 has 2 divisors, whose sum is σ = 100010010001118. Its totient is φ = 100010010001116.
The previous prime is 100010010001103. The next prime is 100010010001127. The reversal of 100010010001117 is 711100010010001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 99185883742521 + 824126258596 = 9959211^2 + 907814^2 .
It is a cyclic number.
It is not a de Polignac number, because 100010010001117 - 219 = 100010009476829 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 100010010001097 and 100010010001106.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100010010001127) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50005005000558 + 50005005000559.
It is an arithmetic number, because the mean of its divisors is an integer number (50005005000559).
Almost surely, 2100010010001117 is an apocalyptic number.
It is an amenable number.
100010010001117 is a deficient number, since it is larger than the sum of its proper divisors (1).
100010010001117 is an equidigital number, since it uses as much as digits as its factorization.
100010010001117 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 7, while the sum is 13.
Adding to 100010010001117 its reverse (711100010010001), we get a palindrome (811110020011118).
The spelling of 100010010001117 in words is "one hundred trillion, ten billion, ten million, one thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •