Base | Representation |
---|---|
bin | 1001001001100100100111… |
… | …10011110000010000001001 |
3 | 2122020110111211021121000222 |
4 | 10210302103303300100021 |
5 | 10114121434244212301 |
6 | 110443014400035425 |
7 | 4144425666401222 |
oct | 444622363602011 |
9 | 78213454247028 |
10 | 20120106632201 |
11 | 6457986733544 |
12 | 230b4b3002b75 |
13 | b2c4195c4584 |
14 | 4d7b65800249 |
15 | 24d5843a131b |
hex | 124c93cf0409 |
20120106632201 has 2 divisors, whose sum is σ = 20120106632202. Its totient is φ = 20120106632200.
The previous prime is 20120106632159. The next prime is 20120106632239. The reversal of 20120106632201 is 10223660102102.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 19482504382201 + 637602250000 = 4413899^2 + 798500^2 .
It is a cyclic number.
It is not a de Polignac number, because 20120106632201 - 26 = 20120106632137 is a prime.
It is a super-2 number, since 2×201201066322012 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (20120106632281) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10060053316100 + 10060053316101.
It is an arithmetic number, because the mean of its divisors is an integer number (10060053316101).
Almost surely, 220120106632201 is an apocalyptic number.
It is an amenable number.
20120106632201 is a deficient number, since it is larger than the sum of its proper divisors (1).
20120106632201 is an equidigital number, since it uses as much as digits as its factorization.
20120106632201 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1728, while the sum is 26.
Adding to 20120106632201 its reverse (10223660102102), we get a palindrome (30343766734303).
The spelling of 20120106632201 in words is "twenty trillion, one hundred twenty billion, one hundred six million, six hundred thirty-two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •