Base | Representation |
---|---|
bin | 11111000000111101… |
… | …00001101101010000 |
3 | 1120222102210110211000 |
4 | 33200132201231100 |
5 | 233100124010111 |
6 | 11352132422000 |
7 | 1126425112263 |
oct | 174036415520 |
9 | 46872713730 |
10 | 16651000656 |
11 | 7075068274 |
12 | 3288477900 |
13 | 17548ca814 |
14 | b3d5d2cda |
15 | 676c39c56 |
hex | 3e07a1b50 |
16651000656 has 80 divisors (see below), whose sum is σ = 48467790720. Its totient is φ = 5472149760.
The previous prime is 16651000633. The next prime is 16651000657. The reversal of 16651000656 is 65600015661.
It is a super-2 number, since 2×166510006562 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a self number, because there is not a number n which added to its sum of digits gives 16651000656.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16651000657) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 240765 + ... + 302108.
It is an arithmetic number, because the mean of its divisors is an integer number (605847384).
Almost surely, 216651000656 is an apocalyptic number.
16651000656 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
16651000656 is an abundant number, since it is smaller than the sum of its proper divisors (31816790064).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16651000656 is a wasteful number, since it uses less digits than its factorization.
16651000656 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 542961 (or 542949 counting only the distinct ones).
The product of its (nonzero) digits is 32400, while the sum is 36.
The spelling of 16651000656 in words is "sixteen billion, six hundred fifty-one million, six hundred fifty-six", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •