Base | Representation |
---|---|
bin | 1001001001010101111001… |
… | …00110001101001101011101 |
3 | 2122012201002212110110222001 |
4 | 10210222330212031031131 |
5 | 10114004241424341221 |
6 | 110435230111122301 |
7 | 4144026042625054 |
oct | 444527446151535 |
9 | 78181085413861 |
10 | 20112201012061 |
11 | 645459a169084 |
12 | 2309a67513391 |
13 | b2b7597a7b32 |
14 | 4d76158a339b |
15 | 24d2702ea391 |
hex | 124abc98d35d |
20112201012061 has 2 divisors, whose sum is σ = 20112201012062. Its totient is φ = 20112201012060.
The previous prime is 20112201011921. The next prime is 20112201012067. The reversal of 20112201012061 is 16021010221102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 19753633584036 + 358567428025 = 4444506^2 + 598805^2 .
It is a cyclic number.
It is not a de Polignac number, because 20112201012061 - 219 = 20112200487773 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20112201012067) 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, 10056100506030 + 10056100506031.
It is an arithmetic number, because the mean of its divisors is an integer number (10056100506031).
Almost surely, 220112201012061 is an apocalyptic number.
It is an amenable number.
20112201012061 is a deficient number, since it is larger than the sum of its proper divisors (1).
20112201012061 is an equidigital number, since it uses as much as digits as its factorization.
20112201012061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96, while the sum is 19.
Adding to 20112201012061 its reverse (16021010221102), we get a palindrome (36133211233163).
The spelling of 20112201012061 in words is "twenty trillion, one hundred twelve billion, two hundred one million, twelve thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •