Base | Representation |
---|---|
bin | 1010001011010111… |
… | …0010100110110000 |
3 | 21001101202111001000 |
4 | 2202311302212300 |
5 | 21043343304104 |
6 | 1131032242000 |
7 | 124462462311 |
oct | 24265624660 |
9 | 7041674030 |
10 | 2732009904 |
11 | 118216a528 |
12 | 642b40300 |
13 | 347013510 |
14 | 1bcba6608 |
15 | 10eca9639 |
hex | a2d729b0 |
2732009904 has 160 divisors (see below), whose sum is σ = 8528898560. Its totient is φ = 832280832.
The previous prime is 2732009887. The next prime is 2732009941. The reversal of 2732009904 is 4099002372.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 576087 + ... + 580809.
It is an arithmetic number, because the mean of its divisors is an integer number (53305616).
Almost surely, 22732009904 is an apocalyptic number.
2732009904 is a gapful number since it is divisible by the number (24) 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 2732009904, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4264449280).
2732009904 is an abundant number, since it is smaller than the sum of its proper divisors (5796888656).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2732009904 is a wasteful number, since it uses less digits than its factorization.
2732009904 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4856 (or 4844 counting only the distinct ones).
The product of its (nonzero) digits is 27216, while the sum is 36.
The square root of 2732009904 is about 52268.6321229091. The cubic root of 2732009904 is about 1397.9578907540.
The spelling of 2732009904 in words is "two billion, seven hundred thirty-two million, nine thousand, nine hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.002 sec. • engine limits •