Base | Representation |
---|---|
bin | 11101111010110110… |
… | …11100100110110000 |
3 | 1112110110100110220000 |
4 | 32331123130212300 |
5 | 230344111201033 |
6 | 11213525350000 |
7 | 1106025111606 |
oct | 167533344660 |
9 | 45413313800 |
10 | 16062990768 |
11 | 68a3159790 |
12 | 3143568300 |
13 | 168cb3c586 |
14 | ac548b876 |
15 | 6402d9a13 |
hex | 3bd6dc9b0 |
16062990768 has 200 divisors, whose sum is σ = 50894528256. Its totient is φ = 4850582400.
The previous prime is 16062990761. The next prime is 16062990791. The reversal of 16062990768 is 86709926061.
16062990768 is a `hidden beast` number, since 1 + 6 + 0 + 629 + 9 + 0 + 7 + 6 + 8 = 666.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is not an unprimeable number, because it can be changed into a prime (16062990761) by changing a digit.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 4431805 + ... + 4435427.
Almost surely, 216062990768 is an apocalyptic number.
16062990768 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 16062990768, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (25447264128).
16062990768 is an abundant number, since it is smaller than the sum of its proper divisors (34831537488).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16062990768 is a wasteful number, since it uses less digits than its factorization.
16062990768 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3965 (or 3950 counting only the distinct ones).
The product of its (nonzero) digits is 1959552, while the sum is 54.
The spelling of 16062990768 in words is "sixteen billion, sixty-two million, nine hundred ninety thousand, seven hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.116 sec. • engine limits •