Base | Representation |
---|---|
bin | 101111011101001111… |
… | …1101110100001100101 |
3 | 100202001111112021010202 |
4 | 1132322133232201211 |
5 | 3132204230031023 |
6 | 114452424000245 |
7 | 10235334200165 |
oct | 1367237564145 |
9 | 322044467122 |
10 | 101913127013 |
11 | 3a248337805 |
12 | 17902600085 |
13 | 97c1c8b269 |
14 | 4d0b1845a5 |
15 | 29b718c128 |
hex | 17ba7ee865 |
101913127013 has 2 divisors, whose sum is σ = 101913127014. Its totient is φ = 101913127012.
The previous prime is 101913127007. The next prime is 101913127039. The reversal of 101913127013 is 310721319101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 97133202244 + 4779924769 = 311662^2 + 69137^2 .
It is a cyclic number.
It is not a de Polignac number, because 101913127013 - 236 = 33193650277 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101913124013) 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, 50956563506 + 50956563507.
It is an arithmetic number, because the mean of its divisors is an integer number (50956563507).
Almost surely, 2101913127013 is an apocalyptic number.
It is an amenable number.
101913127013 is a deficient number, since it is larger than the sum of its proper divisors (1).
101913127013 is an equidigital number, since it uses as much as digits as its factorization.
101913127013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1134, while the sum is 29.
The spelling of 101913127013 in words is "one hundred one billion, nine hundred thirteen million, one hundred twenty-seven thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •