Base | Representation |
---|---|
bin | 1000001101101100… |
… | …0100000101110001 |
3 | 12200122221000211000 |
4 | 2003123010011301 |
5 | 14003424104222 |
6 | 1002442512213 |
7 | 105432265566 |
oct | 20333040561 |
9 | 5618830730 |
10 | 2204909937 |
11 | a3168351a |
12 | 516505669 |
13 | 291a60449 |
14 | 16cb9886d |
15 | cd88b9ac |
hex | 836c4171 |
2204909937 has 16 divisors (see below), whose sum is σ = 3371906560. Its totient is φ = 1422522000.
The previous prime is 2204909887. The next prime is 2204909951. The reversal of 2204909937 is 7399094022.
It is not a de Polignac number, because 2204909937 - 26 = 2204909873 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2204909892 and 2204909901.
It is not an unprimeable number, because it can be changed into a prime (2204909737) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1316314 + ... + 1317987.
It is an arithmetic number, because the mean of its divisors is an integer number (210744160).
Almost surely, 22204909937 is an apocalyptic number.
2204909937 is a gapful number since it is divisible by the number (27) formed by its first and last digit.
It is an amenable number.
2204909937 is a deficient number, since it is larger than the sum of its proper divisors (1166996623).
2204909937 is a wasteful number, since it uses less digits than its factorization.
2204909937 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2634341 (or 2634335 counting only the distinct ones).
The product of its (nonzero) digits is 244944, while the sum is 45.
The square root of 2204909937 is about 46956.4685320351. The cubic root of 2204909937 is about 1301.5582767521.
The spelling of 2204909937 in words is "two billion, two hundred four million, nine hundred nine thousand, nine hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.176 sec. • engine limits •