Base | Representation |
---|---|
bin | 11101110111000110… |
… | …10011010001100100 |
3 | 1112101021002100012000 |
4 | 32323203103101210 |
5 | 230313030322033 |
6 | 11210442325300 |
7 | 1105163314155 |
oct | 167343232144 |
9 | 45337070160 |
10 | 16031495268 |
11 | 68873a7748 |
12 | 3134ab9830 |
13 | 1686462999 |
14 | ac120d92c |
15 | 63c667a13 |
hex | 3bb8d3464 |
16031495268 has 96 divisors (see below), whose sum is σ = 43046277120. Its totient is φ = 5156353440.
The previous prime is 16031495243. The next prime is 16031495269. The reversal of 16031495268 is 86259413061.
16031495268 is a `hidden beast` number, since 1 + 603 + 14 + 9 + 5 + 26 + 8 = 666.
It is not an unprimeable number, because it can be changed into a prime (16031495269) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 338155 + ... + 382637.
It is an arithmetic number, because the mean of its divisors is an integer number (448398720).
Almost surely, 216031495268 is an apocalyptic number.
16031495268 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 16031495268, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (21523138560).
16031495268 is an abundant number, since it is smaller than the sum of its proper divisors (27014781852).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16031495268 is a wasteful number, since it uses less digits than its factorization.
16031495268 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 44614 (or 44606 counting only the distinct ones).
The product of its (nonzero) digits is 311040, while the sum is 45.
The spelling of 16031495268 in words is "sixteen billion, thirty-one million, four hundred ninety-five thousand, two hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •