Base | Representation |
---|---|
bin | 11110111101100001… |
… | …00000000011101000 |
3 | 1120220102112010012120 |
4 | 33132300200003220 |
5 | 233020233024211 |
6 | 11345222311240 |
7 | 1125625004130 |
oct | 173660400350 |
9 | 46812463176 |
10 | 16622158056 |
11 | 705a858409 |
12 | 327a888520 |
13 | 174b93c5aa |
14 | b39845ac0 |
15 | 67443dd06 |
hex | 3dec200e8 |
16622158056 has 256 divisors, whose sum is σ = 52392960000. Its totient is φ = 4287209472.
The previous prime is 16622158001. The next prime is 16622158073. The reversal of 16622158056 is 65085122661.
It is a super-2 number, since 2×166221580562 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a junction number, because it is equal to n+sod(n) for n = 16622157999 and 16622158017.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 7311736 + ... + 7314008.
It is an arithmetic number, because the mean of its divisors is an integer number (204660000).
Almost surely, 216622158056 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 16622158056, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (26196480000).
16622158056 is an abundant number, since it is smaller than the sum of its proper divisors (35770801944).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16622158056 is a wasteful number, since it uses less digits than its factorization.
16622158056 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2416 (or 2412 counting only the distinct ones).
The product of its (nonzero) digits is 172800, while the sum is 42.
The spelling of 16622158056 in words is "sixteen billion, six hundred twenty-two million, one hundred fifty-eight thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •