Base | Representation |
---|---|
bin | 11101110111110101… |
… | …11011010100100000 |
3 | 1112101200201222211222 |
4 | 32323322323110200 |
5 | 230321122013413 |
6 | 11211223154212 |
7 | 1105300050434 |
oct | 167372732440 |
9 | 45350658758 |
10 | 16037688608 |
11 | 688a947907 |
12 | 3136ba5968 |
13 | 1687820996 |
14 | ac1d829c4 |
15 | 63ce8cb08 |
hex | 3bbebb520 |
16037688608 has 54 divisors (see below), whose sum is σ = 32187999753. Its totient is φ = 7865896320.
The previous prime is 16037688553. The next prime is 16037688613. The reversal of 16037688608 is 80688673061.
It is a powerful number, because all its prime factors have an exponent greater than 1 and also an Achilles number because it is not a perfect power.
It can be written as a sum of positive squares in 2 ways, for example, as 10863475984 + 5174212624 = 104228^2 + 71932^2 .
It is an ABA number since it can be written as A⋅BA, here for A=2, B=89548.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 16037688608.
It is an unprimeable number.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 43699241 + ... + 43699607.
Almost surely, 216037688608 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 16037688608
16037688608 is an abundant number, since it is smaller than the sum of its proper divisors (16150311145).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16037688608 is an frugal number, since it uses more digits than its factorization.
16037688608 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 866 (or 430 counting only the distinct ones).
The product of its (nonzero) digits is 2322432, while the sum is 53.
The spelling of 16037688608 in words is "sixteen billion, thirty-seven million, six hundred eighty-eight thousand, six hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •