Base | Representation |
---|---|
bin | 1101000111010111000110… |
… | …0110011001000111111011 |
3 | 1220001112211100002011220222 |
4 | 3101311301212121013323 |
5 | 3342224341420234314 |
6 | 50400301350010255 |
7 | 3015550536661256 |
oct | 321656146310773 |
9 | 56045740064828 |
10 | 14420111102459 |
11 | 465a597870a17 |
12 | 174a86a04698b |
13 | 807a6cc99cca |
14 | 37bd1959809d |
15 | 1a01781abc8e |
hex | d1d719991fb |
14420111102459 has 2 divisors, whose sum is σ = 14420111102460. Its totient is φ = 14420111102458.
The previous prime is 14420111102413. The next prime is 14420111102479. The reversal of 14420111102459 is 95420111102441.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-14420111102459 is a prime.
It is a super-2 number, since 2×144201111024592 (a number of 27 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is not a weakly prime, because it can be changed into another prime (14420111102479) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7210055551229 + 7210055551230.
It is an arithmetic number, because the mean of its divisors is an integer number (7210055551230).
Almost surely, 214420111102459 is an apocalyptic number.
14420111102459 is a deficient number, since it is larger than the sum of its proper divisors (1).
14420111102459 is an equidigital number, since it uses as much as digits as its factorization.
14420111102459 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11520, while the sum is 35.
The spelling of 14420111102459 in words is "fourteen trillion, four hundred twenty billion, one hundred eleven million, one hundred two thousand, four hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •