Base | Representation |
---|---|
bin | 11111001010011101… |
… | …01011011011100000 |
3 | 1121011222211021000020 |
4 | 33211032223123200 |
5 | 233231031413011 |
6 | 11404101353440 |
7 | 1131413610030 |
oct | 174516533340 |
9 | 47158737006 |
10 | 16730732256 |
11 | 7106075857 |
12 | 32ab108880 |
13 | 1768295994 |
14 | b4a0298c0 |
15 | 67dc39006 |
hex | 3e53ab6e0 |
16730732256 has 48 divisors (see below), whose sum is σ = 50192198784. Its totient is φ = 4780209024.
The previous prime is 16730732251. The next prime is 16730732267. The reversal of 16730732256 is 65223703761.
It is a tau number, because it is divible by the number of its divisors (48).
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16730732251) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 12447790 + ... + 12449133.
It is an arithmetic number, because the mean of its divisors is an integer number (1045670808).
Almost surely, 216730732256 is an apocalyptic number.
16730732256 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
16730732256 is an abundant number, since it is smaller than the sum of its proper divisors (33461466528).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16730732256 is a wasteful number, since it uses less digits than its factorization.
16730732256 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24896943 (or 24896935 counting only the distinct ones).
The product of its (nonzero) digits is 317520, while the sum is 42.
The spelling of 16730732256 in words is "sixteen billion, seven hundred thirty million, seven hundred thirty-two thousand, two hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •