Base | Representation |
---|---|
bin | 1001001001010100000001… |
… | …11000010001011011001111 |
3 | 2122012121112001012211111222 |
4 | 10210222000320101123033 |
5 | 10114000213433134314 |
6 | 110434542441033555 |
7 | 4143662155633211 |
oct | 444520070213317 |
9 | 78177461184458 |
10 | 20111199114959 |
11 | 6454125669a47 |
12 | 2309827a858bb |
13 | b2b62a055304 |
14 | 4d755c7c05b1 |
15 | 24d212391c8e |
hex | 124a80e116cf |
20111199114959 has 2 divisors, whose sum is σ = 20111199114960. Its totient is φ = 20111199114958.
The previous prime is 20111199114943. The next prime is 20111199114967. The reversal of 20111199114959 is 95941199111102.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 20111199114959 - 24 = 20111199114943 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 20111199114959.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20111199114059) 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, 10055599557479 + 10055599557480.
It is an arithmetic number, because the mean of its divisors is an integer number (10055599557480).
Almost surely, 220111199114959 is an apocalyptic number.
20111199114959 is a deficient number, since it is larger than the sum of its proper divisors (1).
20111199114959 is an equidigital number, since it uses as much as digits as its factorization.
20111199114959 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 262440, while the sum is 53.
The spelling of 20111199114959 in words is "twenty trillion, one hundred eleven billion, one hundred ninety-nine million, one hundred fourteen thousand, nine hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •