Base | Representation |
---|---|
bin | 1001001001010101111001… |
… | …00110001111011011010001 |
3 | 2122012201002212110221102012 |
4 | 10210222330212033123101 |
5 | 10114004241430134022 |
6 | 110435230111232305 |
7 | 4144026042663401 |
oct | 444527446173321 |
9 | 78181085427365 |
10 | 20112201021137 |
11 | 645459a174985 |
12 | 2309a67518695 |
13 | b2b7597abcc4 |
14 | 4d76158a6801 |
15 | 24d2702ecde2 |
hex | 124abc98f6d1 |
20112201021137 has 2 divisors, whose sum is σ = 20112201021138. Its totient is φ = 20112201021136.
The previous prime is 20112201021109. The next prime is 20112201021167. The reversal of 20112201021137 is 73112010221102.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 19431310345216 + 680890675921 = 4408096^2 + 825161^2 .
It is a cyclic number.
It is not a de Polignac number, because 20112201021137 - 216 = 20112200955601 is a prime.
It is not a weakly prime, because it can be changed into another prime (20112201021167) 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, 10056100510568 + 10056100510569.
It is an arithmetic number, because the mean of its divisors is an integer number (10056100510569).
Almost surely, 220112201021137 is an apocalyptic number.
It is an amenable number.
20112201021137 is a deficient number, since it is larger than the sum of its proper divisors (1).
20112201021137 is an equidigital number, since it uses as much as digits as its factorization.
20112201021137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 336, while the sum is 23.
Adding to 20112201021137 its reverse (73112010221102), we get a palindrome (93224211242239).
The spelling of 20112201021137 in words is "twenty trillion, one hundred twelve billion, two hundred one million, twenty-one thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •