Base | Representation |
---|---|
bin | 11101110011111001… |
… | …00010001100100001 |
3 | 1112022101101122211210 |
4 | 32321330202030201 |
5 | 230234131234203 |
6 | 11204041100333 |
7 | 1104415322550 |
oct | 167174421441 |
9 | 45271348753 |
10 | 16004555553 |
11 | 6873177518 |
12 | 3127a876a9 |
13 | 16809bc91c |
14 | abb7d9d97 |
15 | 63a0e5803 |
hex | 3b9f22321 |
16004555553 has 16 divisors (see below), whose sum is σ = 24397036416. Its totient is φ = 9142032000.
The previous prime is 16004555549. The next prime is 16004555557. The reversal of 16004555553 is 35555540061.
16004555553 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 (16004555549) and next prime (16004555557).
It is not a de Polignac number, because 16004555553 - 22 = 16004555549 is a prime.
It is a super-2 number, since 2×160045555532 (a number of 21 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (16004555557) 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 15 ways as a sum of consecutive naturals, for example, 84948 + ... + 198053.
It is an arithmetic number, because the mean of its divisors is an integer number (1524814776).
Almost surely, 216004555553 is an apocalyptic number.
It is an amenable number.
16004555553 is a deficient number, since it is larger than the sum of its proper divisors (8392480863).
16004555553 is a wasteful number, since it uses less digits than its factorization.
16004555553 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 285704.
The product of its (nonzero) digits is 225000, while the sum is 39.
The spelling of 16004555553 in words is "sixteen billion, four million, five hundred fifty-five thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •