Base | Representation |
---|---|
bin | 11110111100001000… |
… | …01001001011111000 |
3 | 1120212121122100120022 |
4 | 33132010021023320 |
5 | 233004243430130 |
6 | 11344125150012 |
7 | 1125424114166 |
oct | 173604111370 |
9 | 46777570508 |
10 | 16610530040 |
11 | 7054236085 |
12 | 32769bb308 |
13 | 17493caa00 |
14 | b3809a236 |
15 | 6733e37e5 |
hex | 3de1092f8 |
16610530040 has 48 divisors (see below), whose sum is σ = 40469754600. Its totient is φ = 6133116288.
The previous prime is 16610530021. The next prime is 16610530043. The reversal of 16610530040 is 4003501661.
16610530040 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 (26).
It is a junction number, because it is equal to n+sod(n) for n = 16610529991 and 16610530009.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16610530043) by changing a digit.
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 11 ways as a sum of consecutive naturals, for example, 1221830 + ... + 1235349.
Almost surely, 216610530040 is an apocalyptic number.
16610530040 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
16610530040 is an abundant number, since it is smaller than the sum of its proper divisors (23859224560).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16610530040 is a wasteful number, since it uses less digits than its factorization.
16610530040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2457216 (or 2457199 counting only the distinct ones).
The product of its (nonzero) digits is 2160, while the sum is 26.
The spelling of 16610530040 in words is "sixteen billion, six hundred ten million, five hundred thirty thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •