Base | Representation |
---|---|
bin | 11011010011111110… |
… | …10011000001001110 |
3 | 1101211220012210020221 |
4 | 31221333103001032 |
5 | 220012223240132 |
6 | 10423001101554 |
7 | 1026236213044 |
oct | 155177230116 |
9 | 41756183227 |
10 | 14663102542 |
11 | 6244a36a70 |
12 | 2a127878ba |
13 | 14c8acc94a |
14 | 9d15a8394 |
15 | 5ac467e97 |
hex | 369fd304e |
14663102542 has 8 divisors (see below), whose sum is σ = 23994167832. Its totient is φ = 6665046600.
The previous prime is 14663102513. The next prime is 14663102561. The reversal of 14663102542 is 24520136641.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 14663102498 and 14663102507.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 333252309 + ... + 333252352.
It is an arithmetic number, because the mean of its divisors is an integer number (2999270979).
Almost surely, 214663102542 is an apocalyptic number.
14663102542 is a deficient number, since it is larger than the sum of its proper divisors (9331065290).
14663102542 is a wasteful number, since it uses less digits than its factorization.
14663102542 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 666504674.
The product of its (nonzero) digits is 34560, while the sum is 34.
The spelling of 14663102542 in words is "fourteen billion, six hundred sixty-three million, one hundred two thousand, five hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •