Base | Representation |
---|---|
bin | 1100110100110100110010… |
… | …0101001111000111001101 |
3 | 1211221002212002210010201012 |
4 | 3031031030211033013031 |
5 | 3322020201042244123 |
6 | 45554114142255005 |
7 | 2653545225130211 |
oct | 315151445170715 |
9 | 54832762703635 |
10 | 14101662462413 |
11 | 4547532915369 |
12 | 16b8bb6287465 |
13 | 7b3a1ccc9156 |
14 | 36a74a202941 |
15 | 196c3b074378 |
hex | cd34c94f1cd |
14101662462413 has 2 divisors, whose sum is σ = 14101662462414. Its totient is φ = 14101662462412.
The previous prime is 14101662462301. The next prime is 14101662462467. The reversal of 14101662462413 is 31426426610141.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9002028114244 + 5099634348169 = 3000338^2 + 2258237^2 .
It is an emirp because it is prime and its reverse (31426426610141) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-14101662462413 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14101662462493) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7050831231206 + 7050831231207.
It is an arithmetic number, because the mean of its divisors is an integer number (7050831231207).
Almost surely, 214101662462413 is an apocalyptic number.
It is an amenable number.
14101662462413 is a deficient number, since it is larger than the sum of its proper divisors (1).
14101662462413 is an equidigital number, since it uses as much as digits as its factorization.
14101662462413 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 165888, while the sum is 41.
The spelling of 14101662462413 in words is "fourteen trillion, one hundred one billion, six hundred sixty-two million, four hundred sixty-two thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •