Base | Representation |
---|---|
bin | 11101110100000110… |
… | …11000011001110010 |
3 | 1112022111202211222110 |
4 | 32322003120121302 |
5 | 230240111203300 |
6 | 11204143350150 |
7 | 1104436506516 |
oct | 167203303162 |
9 | 45274684873 |
10 | 16006350450 |
11 | 6874193002 |
12 | 31285b2356 |
13 | 168119a8ac |
14 | abbb46146 |
15 | 63a34c550 |
hex | 3ba0d8672 |
16006350450 has 48 divisors (see below), whose sum is σ = 39708396000. Its totient is φ = 4267000320.
The previous prime is 16006350427. The next prime is 16006350473. The reversal of 16006350450 is 5405360061.
16006350450 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (16006350427) and next prime (16006350473).
It is a Harshad number since it is a multiple of its sum of digits (30).
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 509602 + ... + 540098.
It is an arithmetic number, because the mean of its divisors is an integer number (827258250).
Almost surely, 216006350450 is an apocalyptic number.
16006350450 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
16006350450 is an abundant number, since it is smaller than the sum of its proper divisors (23702045550).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16006350450 is a wasteful number, since it uses less digits than its factorization.
16006350450 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34011 (or 34006 counting only the distinct ones).
The product of its (nonzero) digits is 10800, while the sum is 30.
The spelling of 16006350450 in words is "sixteen billion, six million, three hundred fifty thousand, four hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •