Base | Representation |
---|---|
bin | 1100110111100111011011… |
… | …1001100001011111101111 |
3 | 1212002200122010211022002021 |
4 | 3031321312321201133233 |
5 | 3323311403432021134 |
6 | 50032124440011011 |
7 | 2660163462410101 |
oct | 315716671413757 |
9 | 55080563738067 |
10 | 14149617063919 |
11 | 4565900a53237 |
12 | 170635a160a67 |
13 | 7b83c30879bc |
14 | 36cbb901b571 |
15 | 1980e608a0b4 |
hex | cde76e617ef |
14149617063919 has 2 divisors, whose sum is σ = 14149617063920. Its totient is φ = 14149617063918.
The previous prime is 14149617063871. The next prime is 14149617063931. The reversal of 14149617063919 is 91936071694141.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 14149617063919 - 211 = 14149617061871 is a prime.
It is a super-2 number, since 2×141496170639192 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14149617063949) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7074808531959 + 7074808531960.
It is an arithmetic number, because the mean of its divisors is an integer number (7074808531960).
Almost surely, 214149617063919 is an apocalyptic number.
14149617063919 is a deficient number, since it is larger than the sum of its proper divisors (1).
14149617063919 is an equidigital number, since it uses as much as digits as its factorization.
14149617063919 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8817984, while the sum is 61.
The spelling of 14149617063919 in words is "fourteen trillion, one hundred forty-nine billion, six hundred seventeen million, sixty-three thousand, nine hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •