Base | Representation |
---|---|
bin | 10110111101111001111011… |
… | …010101000111010110000111 |
3 | 111020122120022221011102122111 |
4 | 112331321323111013112013 |
5 | 101214431223130000012 |
6 | 554455510251041451 |
7 | 30163545320265664 |
oct | 2675717325072607 |
9 | 436576287142574 |
10 | 101011110000007 |
11 | 2a204631271559 |
12 | b3b4768440287 |
13 | 44493cb07148c |
14 | 1ad2d6c9a0a6b |
15 | ba27e65a2ba7 |
hex | 5bde7b547587 |
101011110000007 has 2 divisors, whose sum is σ = 101011110000008. Its totient is φ = 101011110000006.
The previous prime is 101011109999981. The next prime is 101011110000019. The reversal of 101011110000007 is 700000011110101.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 101011110000007 - 239 = 100461354186119 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101011110000077) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50505555000003 + 50505555000004.
It is an arithmetic number, because the mean of its divisors is an integer number (50505555000004).
Almost surely, 2101011110000007 is an apocalyptic number.
101011110000007 is a deficient number, since it is larger than the sum of its proper divisors (1).
101011110000007 is an equidigital number, since it uses as much as digits as its factorization.
101011110000007 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 13.
Adding to 101011110000007 its reverse (700000011110101), we get a palindrome (801011121110108).
The spelling of 101011110000007 in words is "one hundred one trillion, eleven billion, one hundred ten million, seven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.386 sec. • engine limits •