Base | Representation |
---|---|
bin | 1010000001100001001101… |
… | …0100000100100001101101 |
3 | 1110000121200002012220111022 |
4 | 2200120103110010201231 |
5 | 2421032414242010221 |
6 | 35235023553503525 |
7 | 2215153601144024 |
oct | 240302324044155 |
9 | 43017602186438 |
10 | 11021210110061 |
11 | 356a08386a598 |
12 | 129bb98b71ba5 |
13 | 61c3ac722b38 |
14 | 2a160245d8bb |
15 | 141a487ab4ab |
hex | a061350486d |
11021210110061 has 2 divisors, whose sum is σ = 11021210110062. Its totient is φ = 11021210110060.
The previous prime is 11021210109997. The next prime is 11021210110081. The reversal of 11021210110061 is 16001101212011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10597140855625 + 424069254436 = 3255325^2 + 651206^2 .
It is a cyclic number.
It is not a de Polignac number, because 11021210110061 - 26 = 11021210109997 is a prime.
It is a super-2 number, since 2×110212101100612 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11021210110081) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5510605055030 + 5510605055031.
It is an arithmetic number, because the mean of its divisors is an integer number (5510605055031).
Almost surely, 211021210110061 is an apocalyptic number.
It is an amenable number.
11021210110061 is a deficient number, since it is larger than the sum of its proper divisors (1).
11021210110061 is an equidigital number, since it uses as much as digits as its factorization.
11021210110061 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 11021210110061 its reverse (16001101212011), we get a palindrome (27022311322072).
The spelling of 11021210110061 in words is "eleven trillion, twenty-one billion, two hundred ten million, one hundred ten thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •