Base | Representation |
---|---|
bin | 11101000110110101010… |
… | …10111011111000111101 |
3 | 10112121102202122220010212 |
4 | 32203122222323320331 |
5 | 112341201340213432 |
6 | 2043235021242205 |
7 | 132153303045326 |
oct | 16433252737075 |
9 | 3477382586125 |
10 | 1000101101117 |
11 | 35615aaa9738 |
12 | 1419aba03365 |
13 | 734032065a1 |
14 | 36595a4344d |
15 | 1b0355872b2 |
hex | e8daabbe3d |
1000101101117 has 2 divisors, whose sum is σ = 1000101101118. Its totient is φ = 1000101101116.
The previous prime is 1000101101081. The next prime is 1000101101161. The reversal of 1000101101117 is 7111011010001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 521715845401 + 478385255716 = 722299^2 + 691654^2 .
It is a cyclic number.
It is not a de Polignac number, because 1000101101117 - 210 = 1000101100093 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1000101101177) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 500050550558 + 500050550559.
It is an arithmetic number, because the mean of its divisors is an integer number (500050550559).
Almost surely, 21000101101117 is an apocalyptic number.
It is an amenable number.
1000101101117 is a deficient number, since it is larger than the sum of its proper divisors (1).
1000101101117 is an equidigital number, since it uses as much as digits as its factorization.
1000101101117 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7, while the sum is 14.
Adding to 1000101101117 its reverse (7111011010001), we get a palindrome (8111112111118).
The spelling of 1000101101117 in words is "one trillion, one hundred one million, one hundred one thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •