Base | Representation |
---|---|
bin | 111101111111… |
… | …010001110000 |
3 | 1010120120202200 |
4 | 331333101300 |
5 | 13124444333 |
6 | 1340143200 |
7 | 255060000 |
oct | 75772160 |
9 | 33516680 |
10 | 16249968 |
11 | 9199929 |
12 | 5537b00 |
13 | 349c587 |
14 | 2230000 |
15 | 165ec13 |
hex | f7f470 |
16249968 has 150 divisors (see below), whose sum is σ = 54182544. Its totient is φ = 4544064.
The previous prime is 16249963. The next prime is 16250009. The reversal of 16249968 is 86994261.
It is a happy number.
It is a super-2 number, since 2×162499682 = 528122920002048, which contains 22 as substring.
It is a nude number because it is divisible by every one of its digits.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16249963) by changing a digit.
It is a polite number, since it can be written in 29 ways as a sum of consecutive naturals, for example, 345721 + ... + 345767.
Almost surely, 216249968 is an apocalyptic number.
16249968 is a gapful number since it is divisible by the number (18) 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 16249968, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (27091272).
16249968 is an abundant number, since it is smaller than the sum of its proper divisors (37932576).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16249968 is an equidigital number, since it uses as much as digits as its factorization.
16249968 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 89 (or 59 counting only the distinct ones).
The product of its digits is 186624, while the sum is 45.
The square root of 16249968 is about 4031.1249050358. The cubic root of 16249968 is about 253.2896846929.
The spelling of 16249968 in words is "sixteen million, two hundred forty-nine thousand, nine hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •