Base | Representation |
---|---|
bin | 11101110011110001… |
… | …01010010001000000 |
3 | 1112022022111001210220 |
4 | 32321320222101000 |
5 | 230233401240112 |
6 | 11204003223040 |
7 | 1104403563054 |
oct | 167170522100 |
9 | 45268431726 |
10 | 16003540032 |
11 | 6872643547 |
12 | 3127677a80 |
13 | 168072561c |
14 | abb613c64 |
15 | 639e9498c |
hex | 3b9e2a440 |
16003540032 has 112 divisors (see below), whose sum is σ = 44084199360. Its totient is φ = 5117478912.
The previous prime is 16003539989. The next prime is 16003540079. The reversal of 16003540032 is 23004530061.
It is a happy number.
It is a super-2 number, since 2×160035400322 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a junction number, because it is equal to n+sod(n) for n = 16003539984 and 16003540011.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 865023 + ... + 883329.
Almost surely, 216003540032 is an apocalyptic number.
16003540032 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 16003540032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (22042099680).
16003540032 is an abundant number, since it is smaller than the sum of its proper divisors (28080659328).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16003540032 is a wasteful number, since it uses less digits than its factorization.
16003540032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18508 (or 18498 counting only the distinct ones).
The product of its (nonzero) digits is 2160, while the sum is 24.
The spelling of 16003540032 in words is "sixteen billion, three million, five hundred forty thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •