Base | Representation |
---|---|
bin | 10110101111010101100101… |
… | …001000000110100010100001 |
3 | 111010002212022120002210212201 |
4 | 112233111211020012202201 |
5 | 101102031000042010423 |
6 | 552411544150053201 |
7 | 30031325165522605 |
oct | 2657254510064241 |
9 | 433085276083781 |
10 | 100010010110113 |
11 | 299590094a7054 |
12 | b27273a04a201 |
13 | 43a5b98c6311c |
14 | 1a9a720447505 |
15 | b867534c82ad |
hex | 5af5652068a1 |
100010010110113 has 2 divisors, whose sum is σ = 100010010110114. Its totient is φ = 100010010110112.
The previous prime is 100010010110071. The next prime is 100010010110159. The reversal of 100010010110113 is 311011010010001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 68194679612049 + 31815330498064 = 8258007^2 + 5640508^2 .
It is a cyclic number.
It is not a de Polignac number, because 100010010110113 - 229 = 100009473239201 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 100010010110113.
It is not a weakly prime, because it can be changed into another prime (100010010110513) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50005005055056 + 50005005055057.
It is an arithmetic number, because the mean of its divisors is an integer number (50005005055057).
Almost surely, 2100010010110113 is an apocalyptic number.
It is an amenable number.
100010010110113 is a deficient number, since it is larger than the sum of its proper divisors (1).
100010010110113 is an equidigital number, since it uses as much as digits as its factorization.
100010010110113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3, while the sum is 10.
Adding to 100010010110113 its reverse (311011010010001), we get a palindrome (411021020120114).
The spelling of 100010010110113 in words is "one hundred trillion, ten billion, ten million, one hundred ten thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •