Base | Representation |
---|---|
bin | 11101110100011000… |
… | …10001110010011001 |
3 | 1112022200011100011012 |
4 | 32322030101302121 |
5 | 230241210321044 |
6 | 11204305343305 |
7 | 1104465362111 |
oct | 167214216231 |
9 | 45280140135 |
10 | 16008682649 |
11 | 6875536243 |
12 | 3129337b35 |
13 | 16818062ab |
14 | abc192041 |
15 | 63a65d59e |
hex | 3ba311c99 |
16008682649 has 8 divisors (see below), whose sum is σ = 16029053568. Its totient is φ = 15988327920.
The previous prime is 16008682633. The next prime is 16008682691. The reversal of 16008682649 is 94628680061.
It is a happy number.
16008682649 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 a cyclic number.
It is not a de Polignac number, because 16008682649 - 24 = 16008682633 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 16008682597 and 16008682606.
It is not an unprimeable number, because it can be changed into a prime (16008684649) 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, 3979259 + ... + 3983279.
It is an arithmetic number, because the mean of its divisors is an integer number (2003631696).
Almost surely, 216008682649 is an apocalyptic number.
It is an amenable number.
16008682649 is a deficient number, since it is larger than the sum of its proper divisors (20370919).
16008682649 is a wasteful number, since it uses less digits than its factorization.
16008682649 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8095.
The product of its (nonzero) digits is 995328, while the sum is 50.
The spelling of 16008682649 in words is "sixteen billion, eight million, six hundred eighty-two thousand, six hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •