Base | Representation |
---|---|
bin | 11010010101111001… |
… | …01010101111110101 |
3 | 1100111121021021101000 |
4 | 31022330222233311 |
5 | 212430413211410 |
6 | 10255154553513 |
7 | 1010313506331 |
oct | 151274525765 |
9 | 40447237330 |
10 | 14142319605 |
11 | 5aa7a75047 |
12 | 28a8298899 |
13 | 1444c4bc6b |
14 | 9823627c1 |
15 | 57b896dc0 |
hex | 34af2abf5 |
14142319605 has 32 divisors (see below), whose sum is σ = 25554078720. Its totient is φ = 7418917440.
The previous prime is 14142319549. The next prime is 14142319621. The reversal of 14142319605 is 50691324141.
It is a happy number.
14142319605 is a `hidden beast` number, since 1 + 4 + 1 + 42 + 3 + 1 + 9 + 605 = 666.
It is a de Polignac number, because none of the positive numbers 2k-14142319605 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 14142319605.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 850437 + ... + 866906.
It is an arithmetic number, because the mean of its divisors is an integer number (798564960).
Almost surely, 214142319605 is an apocalyptic number.
14142319605 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
14142319605 is a deficient number, since it is larger than the sum of its proper divisors (11411759115).
14142319605 is a wasteful number, since it uses less digits than its factorization.
14142319605 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1717418 (or 1717412 counting only the distinct ones).
The product of its (nonzero) digits is 25920, while the sum is 36.
It can be divided in two parts, 141423 and 19605, that added together give a triangular number (161028 = T567).
The spelling of 14142319605 in words is "fourteen billion, one hundred forty-two million, three hundred nineteen thousand, six hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •