Base | Representation |
---|---|
bin | 1001000110101110010011… |
… | …0001100111100100011101 |
3 | 1022110001102121102221201122 |
4 | 2101223210301213210131 |
5 | 2303010224133341221 |
6 | 33143012534020325 |
7 | 2052164455032026 |
oct | 221534461474435 |
9 | 38401377387648 |
10 | 10011112012061 |
11 | 320a763818166 |
12 | 11582791a76a5 |
13 | 578075340ca4 |
14 | 26877cc39c4d |
15 | 12562a75aeab |
hex | 91ae4c6791d |
10011112012061 has 2 divisors, whose sum is σ = 10011112012062. Its totient is φ = 10011112012060.
The previous prime is 10011112012007. The next prime is 10011112012081. The reversal of 10011112012061 is 16021021111001.
10011112012061 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9304293486436 + 706818525625 = 3050294^2 + 840725^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10011112012061 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10011112012081) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5005556006030 + 5005556006031.
It is an arithmetic number, because the mean of its divisors is an integer number (5005556006031).
Almost surely, 210011112012061 is an apocalyptic number.
It is an amenable number.
10011112012061 is a deficient number, since it is larger than the sum of its proper divisors (1).
10011112012061 is an equidigital number, since it uses as much as digits as its factorization.
10011112012061 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 24, while the sum is 17.
Adding to 10011112012061 its reverse (16021021111001), we get a palindrome (26032133123062).
The spelling of 10011112012061 in words is "ten trillion, eleven billion, one hundred twelve million, twelve thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •