Base | Representation |
---|---|
bin | 1001001001100100110100… |
… | …00110001000010110100001 |
3 | 2122020110210011202120012212 |
4 | 10210302122012020112201 |
5 | 10114122143300102201 |
6 | 110443033044531505 |
7 | 4144431420100643 |
oct | 444623206102641 |
9 | 78213704676185 |
10 | 20120212112801 |
11 | 6457a30228699 |
12 | 230b5223b0b95 |
13 | b2c435406828 |
14 | 4d7b7581a893 |
15 | 24d58d789abb |
hex | 124c9a1885a1 |
20120212112801 has 2 divisors, whose sum is σ = 20120212112802. Its totient is φ = 20120212112800.
The previous prime is 20120212112797. The next prime is 20120212112809. The reversal of 20120212112801 is 10821121202102.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 19303720960000 + 816491152801 = 4393600^2 + 903599^2 .
It is a cyclic number.
It is not a de Polignac number, because 20120212112801 - 22 = 20120212112797 is a prime.
It is not a weakly prime, because it can be changed into another prime (20120212112809) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10060106056400 + 10060106056401.
It is an arithmetic number, because the mean of its divisors is an integer number (10060106056401).
Almost surely, 220120212112801 is an apocalyptic number.
It is an amenable number.
20120212112801 is a deficient number, since it is larger than the sum of its proper divisors (1).
20120212112801 is an equidigital number, since it uses as much as digits as its factorization.
20120212112801 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 256, while the sum is 23.
Adding to 20120212112801 its reverse (10821121202102), we get a palindrome (30941333314903).
The spelling of 20120212112801 in words is "twenty trillion, one hundred twenty billion, two hundred twelve million, one hundred twelve thousand, eight hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •