Base | Representation |
---|---|
bin | 11010110011010010… |
… | …11001100000010111 |
3 | 1101010210022012102020 |
4 | 31121221121200113 |
5 | 213432031121422 |
6 | 10335444344223 |
7 | 1016366566665 |
oct | 153151314027 |
9 | 41123265366 |
10 | 14388926487 |
11 | 61141a0491 |
12 | 29569a5073 |
13 | 14840740b0 |
14 | 9a6dd7c35 |
15 | 59335a95c |
hex | 359a59817 |
14388926487 has 32 divisors (see below), whose sum is σ = 21115454976. Its totient is φ = 8660995200.
The previous prime is 14388926479. The next prime is 14388926521. The reversal of 14388926487 is 78462988341.
It is a happy number.
14388926487 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 14388926487 - 23 = 14388926479 is a prime.
It is a super-2 number, since 2×143889264872 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 14388926487.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14388926467) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 673662 + ... + 694692.
It is an arithmetic number, because the mean of its divisors is an integer number (659857968).
Almost surely, 214388926487 is an apocalyptic number.
14388926487 is a deficient number, since it is larger than the sum of its proper divisors (6726528489).
14388926487 is a wasteful number, since it uses less digits than its factorization.
14388926487 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21431.
The product of its digits is 18579456, while the sum is 60.
The spelling of 14388926487 in words is "fourteen billion, three hundred eighty-eight million, nine hundred twenty-six thousand, four hundred eighty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •