Base | Representation |
---|---|
bin | 11110100001011010… |
… | …01011010011000000 |
3 | 1120021222220122120221 |
4 | 33100231023103000 |
5 | 232024404434233 |
6 | 11310001312424 |
7 | 1120033102111 |
oct | 172055132300 |
9 | 46258818527 |
10 | 16386405568 |
11 | 6a49776045 |
12 | 3213935714 |
13 | 1711b47b90 |
14 | b163d8208 |
15 | 65d8c142d |
hex | 3d0b4b4c0 |
16386405568 has 168 divisors, whose sum is σ = 37819112576. Its totient is φ = 6994944000.
The previous prime is 16386405551. The next prime is 16386405571. The reversal of 16386405568 is 86550468361.
It is a super-3 number, since 3×163864055683 (a number of 32 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (52).
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 13643368 + ... + 13644568.
Almost surely, 216386405568 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 16386405568, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (18909556288).
16386405568 is an abundant number, since it is smaller than the sum of its proper divisors (21432707008).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16386405568 is a wasteful number, since it uses less digits than its factorization.
16386405568 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1303 (or 1270 counting only the distinct ones).
The product of its (nonzero) digits is 4147200, while the sum is 52.
The spelling of 16386405568 in words is "sixteen billion, three hundred eighty-six million, four hundred five thousand, five hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •