Base | Representation |
---|---|
bin | 1001010010011011011010… |
… | …0111101001111000010101 |
3 | 1100011021110212001121012001 |
4 | 2110212312213221320111 |
5 | 2314304041441023221 |
6 | 33415230451155301 |
7 | 2102543602130545 |
oct | 224466647517025 |
9 | 40137425047161 |
10 | 10212201111061 |
11 | 3287a74328584 |
12 | 118b2395a5b31 |
13 | 591011195131 |
14 | 2743b781d325 |
15 | 12a999611391 |
hex | 949b69e9e15 |
10212201111061 has 2 divisors, whose sum is σ = 10212201111062. Its totient is φ = 10212201111060.
The previous prime is 10212201110977. The next prime is 10212201111139. The reversal of 10212201111061 is 16011110221201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7325651080836 + 2886550030225 = 2706594^2 + 1698985^2 .
It is a cyclic number.
It is not a de Polignac number, because 10212201111061 - 211 = 10212201109013 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10212201111661) 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, 5106100555530 + 5106100555531.
It is an arithmetic number, because the mean of its divisors is an integer number (5106100555531).
Almost surely, 210212201111061 is an apocalyptic number.
It is an amenable number.
10212201111061 is a deficient number, since it is larger than the sum of its proper divisors (1).
10212201111061 is an equidigital number, since it uses as much as digits as its factorization.
10212201111061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 19.
Adding to 10212201111061 its reverse (16011110221201), we get a palindrome (26223311332262).
The spelling of 10212201111061 in words is "ten trillion, two hundred twelve billion, two hundred one million, one hundred eleven thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •