Base | Representation |
---|---|
bin | 10110101111010101101011… |
… | …000101001100001100000101 |
3 | 111010002212120112002020220212 |
4 | 112233111223011030030011 |
5 | 101102031201130310432 |
6 | 552412002115205205 |
7 | 30031330520620346 |
oct | 2657255305141405 |
9 | 433085515066825 |
10 | 100010110010117 |
11 | 2995905a92a43a |
12 | b2727675a6805 |
13 | 43a5bb3870258 |
14 | 1a9a72d8100cd |
15 | b8675c15d2b2 |
hex | 5af56b14c305 |
100010110010117 has 2 divisors, whose sum is σ = 100010110010118. Its totient is φ = 100010110010116.
The previous prime is 100010110010087. The next prime is 100010110010143. The reversal of 100010110010117 is 711010011010001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 69727827401761 + 30282282608356 = 8350319^2 + 5502934^2 .
It is a cyclic number.
It is not a de Polignac number, because 100010110010117 - 218 = 100010109747973 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100010110510117) 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, 50005055005058 + 50005055005059.
It is an arithmetic number, because the mean of its divisors is an integer number (50005055005059).
Almost surely, 2100010110010117 is an apocalyptic number.
It is an amenable number.
100010110010117 is a deficient number, since it is larger than the sum of its proper divisors (1).
100010110010117 is an equidigital number, since it uses as much as digits as its factorization.
100010110010117 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 100010110010117 its reverse (711010011010001), we get a palindrome (811020121020118).
The spelling of 100010110010117 in words is "one hundred trillion, ten billion, one hundred ten million, ten thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •