Base | Representation |
---|---|
bin | 10110110000101100011110… |
… | …010110100111001101010001 |
3 | 111010102210010221002112000201 |
4 | 112300230132112213031101 |
5 | 101110043040333341423 |
6 | 552522454321415201 |
7 | 30041140250562604 |
oct | 2660543626471521 |
9 | 433383127075021 |
10 | 100103312012113 |
11 | 29994637a40a73 |
12 | b28883879a501 |
13 | 43b1917b82367 |
14 | 1aa1051a9833b |
15 | b88db46812ad |
hex | 5b0b1e5a7351 |
100103312012113 has 2 divisors, whose sum is σ = 100103312012114. Its totient is φ = 100103312012112.
The previous prime is 100103312012111. The next prime is 100103312012129. The reversal of 100103312012113 is 311210213301001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 91771475946049 + 8331836066064 = 9579743^2 + 2886492^2 .
It is a cyclic number.
It is not a de Polignac number, because 100103312012113 - 21 = 100103312012111 is a prime.
Together with 100103312012111, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (100103312012111) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50051656006056 + 50051656006057.
It is an arithmetic number, because the mean of its divisors is an integer number (50051656006057).
Almost surely, 2100103312012113 is an apocalyptic number.
It is an amenable number.
100103312012113 is a deficient number, since it is larger than the sum of its proper divisors (1).
100103312012113 is an equidigital number, since it uses as much as digits as its factorization.
100103312012113 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 100103312012113 its reverse (311210213301001), we get a palindrome (411313525313114).
The spelling of 100103312012113 in words is "one hundred trillion, one hundred three billion, three hundred twelve million, twelve thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •