Base | Representation |
---|---|
bin | 10110101111010001011110… |
… | …111010110111100001000001 |
3 | 111010002102221222102101011002 |
4 | 112233101132322313201001 |
5 | 101101442442404310423 |
6 | 552405535442101345 |
7 | 30031111161013304 |
oct | 2657213672674101 |
9 | 433072858371132 |
10 | 100005611010113 |
11 | 29957161302116 |
12 | b27191094a855 |
13 | 43a5647756983 |
14 | 1a9a4240c4b3b |
15 | b865971bb228 |
hex | 5af45eeb7841 |
100005611010113 has 2 divisors, whose sum is σ = 100005611010114. Its totient is φ = 100005611010112.
The previous prime is 100005611010059. The next prime is 100005611010119. The reversal of 100005611010113 is 311010116500001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 58762910495809 + 41242700514304 = 7665697^2 + 6422048^2 .
It is a cyclic number.
It is not a de Polignac number, because 100005611010113 - 236 = 99936891533377 is a prime.
It is a super-2 number, since 2×1000056110101132 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (100005611010119) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50002805505056 + 50002805505057.
It is an arithmetic number, because the mean of its divisors is an integer number (50002805505057).
Almost surely, 2100005611010113 is an apocalyptic number.
It is an amenable number.
100005611010113 is a deficient number, since it is larger than the sum of its proper divisors (1).
100005611010113 is an equidigital number, since it uses as much as digits as its factorization.
100005611010113 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 90, while the sum is 20.
Adding to 100005611010113 its reverse (311010116500001), we get a palindrome (411015727510114).
The spelling of 100005611010113 in words is "one hundred trillion, five billion, six hundred eleven million, ten thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •