Base | Representation |
---|---|
bin | 11110101111001100… |
… | …10110011000110100 |
3 | 1120121001112022211210 |
4 | 33113212112120310 |
5 | 232244011302000 |
6 | 11325252201420 |
7 | 1122636110616 |
oct | 172746263064 |
9 | 46531468753 |
10 | 16502056500 |
11 | 6aa8a87326 |
12 | 3246609270 |
13 | 172caab397 |
14 | b27900db6 |
15 | 668b18350 |
hex | 3d7996634 |
16502056500 has 48 divisors (see below), whose sum is σ = 48053992896. Its totient is φ = 4400548000.
The previous prime is 16502056433. The next prime is 16502056513. The reversal of 16502056500 is 565020561.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5499186 + ... + 5502185.
It is an arithmetic number, because the mean of its divisors is an integer number (1001124852).
Almost surely, 216502056500 is an apocalyptic number.
16502056500 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
16502056500 is an abundant number, since it is smaller than the sum of its proper divisors (31551936396).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16502056500 is a wasteful number, since it uses less digits than its factorization.
16502056500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11001393 (or 11001381 counting only the distinct ones).
The product of its (nonzero) digits is 9000, while the sum is 30.
The spelling of 16502056500 in words is "sixteen billion, five hundred two million, fifty-six thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •