Base | Representation |
---|---|
bin | 11010110100100011… |
… | …01011011011110111 |
3 | 1101011112011122220201 |
4 | 31122101223123313 |
5 | 213442232020222 |
6 | 10340502541331 |
7 | 1016555415556 |
oct | 153221533367 |
9 | 41145148821 |
10 | 14399485687 |
11 | 611a1527a4 |
12 | 295a437847 |
13 | 1486300342 |
14 | 9a8585d9d |
15 | 594244427 |
hex | 35a46b6f7 |
14399485687 has 2 divisors, whose sum is σ = 14399485688. Its totient is φ = 14399485686.
The previous prime is 14399485631. The next prime is 14399485691. The reversal of 14399485687 is 78658499341.
It is a strong prime.
It is an emirp because it is prime and its reverse (78658499341) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 14399485687 - 215 = 14399452919 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14399483687) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7199742843 + 7199742844.
It is an arithmetic number, because the mean of its divisors is an integer number (7199742844).
Almost surely, 214399485687 is an apocalyptic number.
14399485687 is a deficient number, since it is larger than the sum of its proper divisors (1).
14399485687 is an equidigital number, since it uses as much as digits as its factorization.
14399485687 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 52254720, while the sum is 64.
The spelling of 14399485687 in words is "fourteen billion, three hundred ninety-nine million, four hundred eighty-five thousand, six hundred eighty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •