Base | Representation |
---|---|
bin | 10110111101101111110001… |
… | …000010110110000010010001 |
3 | 111020121112011121010000210002 |
4 | 112331233301002312002101 |
5 | 101214241402201120423 |
6 | 554450503520215345 |
7 | 30163011053061302 |
oct | 2675576102660221 |
9 | 436545147100702 |
10 | 101000200020113 |
11 | 2a1aaa42929149 |
12 | b3b262276a555 |
13 | 444837c9a4c84 |
14 | 1ad2615a447a9 |
15 | ba23a8896228 |
hex | 5bdbf10b6091 |
101000200020113 has 2 divisors, whose sum is σ = 101000200020114. Its totient is φ = 101000200020112.
The previous prime is 101000200020077. The next prime is 101000200020191. The reversal of 101000200020113 is 311020002000101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 94674009223249 + 6326190796864 = 9730057^2 + 2515192^2 .
It is a cyclic number.
It is not a de Polignac number, because 101000200020113 - 232 = 100995905052817 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 101000200020094 and 101000200020103.
It is not a weakly prime, because it can be changed into another prime (101000200020613) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50500100010056 + 50500100010057.
It is an arithmetic number, because the mean of its divisors is an integer number (50500100010057).
Almost surely, 2101000200020113 is an apocalyptic number.
It is an amenable number.
101000200020113 is a deficient number, since it is larger than the sum of its proper divisors (1).
101000200020113 is an equidigital number, since it uses as much as digits as its factorization.
101000200020113 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 12, while the sum is 11.
Adding to 101000200020113 its reverse (311020002000101), we get a palindrome (412020202020214).
The spelling of 101000200020113 in words is "one hundred one trillion, two hundred million, twenty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •