Base | Representation |
---|---|
bin | 111011110111111… |
… | …0100010101000000 |
3 | 12012000022222120012 |
4 | 1313233310111000 |
5 | 13103302230213 |
6 | 531204204052 |
7 | 100533264161 |
oct | 16757642500 |
9 | 5160288505 |
10 | 2009023808 |
11 | 941050360 |
12 | 480999628 |
13 | 2602b67ac |
14 | 150b67768 |
15 | bb5964a8 |
hex | 77bf4540 |
2009023808 has 56 divisors (see below), whose sum is σ = 4354580064. Its totient is φ = 912038400.
The previous prime is 2009023763. The next prime is 2009023811. The reversal of 2009023808 is 8083209002.
It is a happy number.
It is a super-2 number, since 2×20090238082 = 8072353322221641728, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (32).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 823166 + ... + 825602.
Almost surely, 22009023808 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 2009023808, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2177290032).
2009023808 is an abundant number, since it is smaller than the sum of its proper divisors (2345556256).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2009023808 is a wasteful number, since it uses less digits than its factorization.
2009023808 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3631 (or 3621 counting only the distinct ones).
The product of its (nonzero) digits is 6912, while the sum is 32.
The square root of 2009023808 is about 44822.1352458805. The cubic root of 2009023808 is about 1261.8130881182.
The spelling of 2009023808 in words is "two billion, nine million, twenty-three thousand, eight hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •