Base | Representation |
---|---|
bin | 1001001001100100011100… |
… | …00011100011110010000101 |
3 | 2122020110021002122212101122 |
4 | 10210302032003203302011 |
5 | 10114121240042042013 |
6 | 110443001031203325 |
7 | 4144423415111501 |
oct | 444621603436205 |
9 | 78213232585348 |
10 | 20120010112133 |
11 | 64579371a9598 |
12 | 230b486816545 |
13 | b2c4025cb9c9 |
14 | 4d7b56a77301 |
15 | 24d57ab87a08 |
hex | 124c8e0e3c85 |
20120010112133 has 2 divisors, whose sum is σ = 20120010112134. Its totient is φ = 20120010112132.
The previous prime is 20120010112093. The next prime is 20120010112157. The reversal of 20120010112133 is 33121101002102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 17211354903649 + 2908655208484 = 4148657^2 + 1705478^2 .
It is a cyclic number.
It is not a de Polignac number, because 20120010112133 - 222 = 20120005917829 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20120010111133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10060005056066 + 10060005056067.
It is an arithmetic number, because the mean of its divisors is an integer number (10060005056067).
Almost surely, 220120010112133 is an apocalyptic number.
It is an amenable number.
20120010112133 is a deficient number, since it is larger than the sum of its proper divisors (1).
20120010112133 is an equidigital number, since it uses as much as digits as its factorization.
20120010112133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 20120010112133 its reverse (33121101002102), we get a palindrome (53241111114235).
The spelling of 20120010112133 in words is "twenty trillion, one hundred twenty billion, ten million, one hundred twelve thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •