Base | Representation |
---|---|
bin | 1001000110101100100111… |
… | …0101101110111101001101 |
3 | 1022110000021010002202020101 |
4 | 2101223021311232331031 |
5 | 2303003312441343221 |
6 | 33142500032051101 |
7 | 2052150326633566 |
oct | 221531165567515 |
9 | 38400233082211 |
10 | 10010660106061 |
11 | 320a55171a52a |
12 | 1158171993a91 |
13 | 5780028278a4 |
14 | 268738c0316d |
15 | 125600c42d91 |
hex | 91ac9d6ef4d |
10010660106061 has 2 divisors, whose sum is σ = 10010660106062. Its totient is φ = 10010660106060.
The previous prime is 10010660106049. The next prime is 10010660106089. The reversal of 10010660106061 is 16060106601001.
It is an a-pointer prime, because the next prime (10010660106089) can be obtained adding 10010660106061 to its sum of digits (28).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9838824156100 + 171835949961 = 3136690^2 + 414531^2 .
It is a cyclic number.
It is not a de Polignac number, because 10010660106061 - 223 = 10010651717453 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10010660107061) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5005330053030 + 5005330053031.
It is an arithmetic number, because the mean of its divisors is an integer number (5005330053031).
Almost surely, 210010660106061 is an apocalyptic number.
It is an amenable number.
10010660106061 is a deficient number, since it is larger than the sum of its proper divisors (1).
10010660106061 is an equidigital number, since it uses as much as digits as its factorization.
10010660106061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1296, while the sum is 28.
Adding to 10010660106061 its reverse (16060106601001), we get a palindrome (26070766707062).
The spelling of 10010660106061 in words is "ten trillion, ten billion, six hundred sixty million, one hundred six thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •