Base | Representation |
---|---|
bin | 11101110111001110… |
… | …00101001000001010 |
3 | 1112101022221200002000 |
4 | 32323213011020022 |
5 | 230313304022043 |
6 | 11210515451430 |
7 | 1105204611252 |
oct | 167347051012 |
9 | 45338850060 |
10 | 16032485898 |
11 | 6887a13a50 |
12 | 31352b6b76 |
13 | 168671b860 |
14 | ac13ca962 |
15 | 63c7b12d3 |
hex | 3bb9c520a |
16032485898 has 64 divisors (see below), whose sum is σ = 41856393600. Its totient is φ = 4484609280.
The previous prime is 16032485863. The next prime is 16032485927. The reversal of 16032485898 is 89858423061.
16032485898 is a `hidden beast` number, since 1 + 603 + 24 + 8 + 5 + 8 + 9 + 8 = 666.
16032485898 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (54).
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 31 ways as a sum of consecutive naturals, for example, 1030383 + ... + 1045826.
It is an arithmetic number, because the mean of its divisors is an integer number (654006150).
Almost surely, 216032485898 is an apocalyptic number.
16032485898 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
16032485898 is an abundant number, since it is smaller than the sum of its proper divisors (25823907702).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16032485898 is a wasteful number, since it uses less digits than its factorization.
16032485898 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2076244 (or 2076238 counting only the distinct ones).
The product of its (nonzero) digits is 3317760, while the sum is 54.
The spelling of 16032485898 in words is "sixteen billion, thirty-two million, four hundred eighty-five thousand, eight hundred ninety-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •