Base | Representation |
---|---|
bin | 111111100011010… |
… | …1000010111000000 |
3 | 12111121120102001221 |
4 | 1333012220113000 |
5 | 13331401211413 |
6 | 551333404424 |
7 | 103562323450 |
oct | 17706502700 |
9 | 5447512057 |
10 | 2132444608 |
11 | 9a4789218 |
12 | 4b6199714 |
13 | 27ca3a758 |
14 | 1632d3d60 |
15 | c732568d |
hex | 7f1a85c0 |
2132444608 has 56 divisors (see below), whose sum is σ = 4880559200. Its totient is φ = 905499648.
The previous prime is 2132444603. The next prime is 2132444621. The reversal of 2132444608 is 8064442312.
It is a tau number, because it is divible by the number of its divisors (56).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2132444603) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 26998 + ... + 70666.
Almost surely, 22132444608 is an apocalyptic number.
2132444608 is a gapful number since it is divisible by the number (28) 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 2132444608, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2440279600).
2132444608 is an abundant number, since it is smaller than the sum of its proper divisors (2748114592).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2132444608 is a wasteful number, since it uses less digits than its factorization.
2132444608 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43797 (or 43787 counting only the distinct ones).
The product of its (nonzero) digits is 36864, while the sum is 34.
The square root of 2132444608 is about 46178.3997990402. The cubic root of 2132444608 is about 1287.1403932127.
The spelling of 2132444608 in words is "two billion, one hundred thirty-two million, four hundred forty-four thousand, six hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.124 sec. • engine limits •