Base | Representation |
---|---|
bin | 11101111011001111… |
… | …11011001000011010 |
3 | 1112110200111122112100 |
4 | 32331213323020122 |
5 | 230400430332110 |
6 | 11214123424230 |
7 | 1106064653424 |
oct | 167547731032 |
9 | 45420448470 |
10 | 16066261530 |
11 | 68a4a930a0 |
12 | 3144685076 |
13 | 1690716237 |
14 | ac5a9d814 |
15 | 640733bc0 |
hex | 3bd9fb21a |
16066261530 has 192 divisors, whose sum is σ = 48451882752. Its totient is φ = 3654942720.
The previous prime is 16066261489. The next prime is 16066261543. The reversal of 16066261530 is 3516266061.
16066261530 is a `hidden beast` number, since 1 + 6 + 0 + 6 + 6 + 2 + 615 + 30 = 666.
It is a hoax number, since the sum of its digits (36) coincides with the sum of the digits of its distinct prime factors.
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 1200154 + ... + 1213466.
It is an arithmetic number, because the mean of its divisors is an integer number (252353556).
Almost surely, 216066261530 is an apocalyptic number.
16066261530 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 16066261530, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (24225941376).
16066261530 is an abundant number, since it is smaller than the sum of its proper divisors (32385621222).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16066261530 is a wasteful number, since it uses less digits than its factorization.
16066261530 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13413 (or 13410 counting only the distinct ones).
The product of its (nonzero) digits is 38880, while the sum is 36.
The spelling of 16066261530 in words is "sixteen billion, sixty-six million, two hundred sixty-one thousand, five hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •