Base | Representation |
---|---|
bin | 11011010001001110… |
… | …00000011010101111 |
3 | 1101210021122220110210 |
4 | 31220213000122233 |
5 | 214440312121204 |
6 | 10420413033503 |
7 | 1025535405234 |
oct | 155047003257 |
9 | 41707586423 |
10 | 14639957679 |
11 | 6232968986 |
12 | 2a06a85893 |
13 | 14c4087c69 |
14 | 9cc4a178b |
15 | 5aa3e5389 |
hex | 3689c06af |
14639957679 has 8 divisors (see below), whose sum is σ = 19621083952. Its totient is φ = 9709401600.
The previous prime is 14639957671. The next prime is 14639957681. The reversal of 14639957679 is 97675993641.
It is a happy number.
14639957679 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 14639957679 - 23 = 14639957671 is a prime.
It is a super-2 number, since 2×146399576792 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14639957671) 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 7 ways as a sum of consecutive naturals, for example, 12641872 + ... + 12643029.
It is an arithmetic number, because the mean of its divisors is an integer number (2452635494).
Almost surely, 214639957679 is an apocalyptic number.
14639957679 is a deficient number, since it is larger than the sum of its proper divisors (4981126273).
14639957679 is a wasteful number, since it uses less digits than its factorization.
14639957679 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25285097.
The product of its digits is 77157360, while the sum is 66.
The spelling of 14639957679 in words is "fourteen billion, six hundred thirty-nine million, nine hundred fifty-seven thousand, six hundred seventy-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •