Base | Representation |
---|---|
bin | 10110111111011000000000… |
… | …000001111011001010100001 |
3 | 111021000020001112101220111212 |
4 | 112333120000001323022201 |
5 | 101223110110332240123 |
6 | 555014133354315505 |
7 | 30204052415151002 |
oct | 2677300001731241 |
9 | 437006045356455 |
10 | 101112120586913 |
11 | 2a2434560a1547 |
12 | b410258728b95 |
13 | 4455aa8056b27 |
14 | 1ad7bd1d271a9 |
15 | ba52593b0878 |
hex | 5bf60007b2a1 |
101112120586913 has 2 divisors, whose sum is σ = 101112120586914. Its totient is φ = 101112120586912.
The previous prime is 101112120586909. The next prime is 101112120586937. The reversal of 101112120586913 is 319685021211101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 100842808370704 + 269312216209 = 10042052^2 + 518953^2 .
It is a cyclic number.
It is not a de Polignac number, because 101112120586913 - 22 = 101112120586909 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (101112120586903) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50556060293456 + 50556060293457.
It is an arithmetic number, because the mean of its divisors is an integer number (50556060293457).
Almost surely, 2101112120586913 is an apocalyptic number.
It is an amenable number.
101112120586913 is a deficient number, since it is larger than the sum of its proper divisors (1).
101112120586913 is an equidigital number, since it uses as much as digits as its factorization.
101112120586913 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 25920, while the sum is 41.
The spelling of 101112120586913 in words is "one hundred one trillion, one hundred twelve billion, one hundred twenty million, five hundred eighty-six thousand, nine hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •