Base | Representation |
---|---|
bin | 1001001001100100011100… |
… | …01011001110000000110111 |
3 | 2122020110021020102212211111 |
4 | 10210302032023032000313 |
5 | 10114121241100320434 |
6 | 110443001142215451 |
7 | 4144423441143622 |
oct | 444621613160067 |
9 | 78213236385744 |
10 | 20120012120119 |
11 | 645793835018a |
12 | 230b487424587 |
13 | b2c402b52972 |
14 | 4d7b5703adb9 |
15 | 24d57ae32964 |
hex | 124c8e2ce037 |
20120012120119 has 2 divisors, whose sum is σ = 20120012120120. Its totient is φ = 20120012120118.
The previous prime is 20120012120081. The next prime is 20120012120141. The reversal of 20120012120119 is 91102121002102.
It is an a-pointer prime, because the next prime (20120012120141) can be obtained adding 20120012120119 to its sum of digits (22).
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20120012120119 is a prime.
It is a super-2 number, since 2×201200121201192 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 20120012120119.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20120012120419) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10060006060059 + 10060006060060.
It is an arithmetic number, because the mean of its divisors is an integer number (10060006060060).
Almost surely, 220120012120119 is an apocalyptic number.
20120012120119 is a deficient number, since it is larger than the sum of its proper divisors (1).
20120012120119 is an equidigital number, since it uses as much as digits as its factorization.
20120012120119 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 144, while the sum is 22.
The spelling of 20120012120119 in words is "twenty trillion, one hundred twenty billion, twelve million, one hundred twenty thousand, one hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •