Base | Representation |
---|---|
bin | 111101100111010… |
… | …0010100100000000 |
3 | 12100002012021012100 |
4 | 1323032202210000 |
5 | 13213224043102 |
6 | 541051430400 |
7 | 102142454634 |
oct | 17316424400 |
9 | 5302167170 |
10 | 2067409152 |
11 | 970aa9106 |
12 | 498455400 |
13 | 26c419833 |
14 | 158804dc4 |
15 | c177aa1c |
hex | 7b3a2900 |
2067409152 has 216 divisors, whose sum is σ = 6361336800. Its totient is φ = 643866624.
The previous prime is 2067409109. The next prime is 2067409181. The reversal of 2067409152 is 2519047602.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 3633124 + ... + 3633692.
Almost surely, 22067409152 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 2067409152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3180668400).
2067409152 is an abundant number, since it is smaller than the sum of its proper divisors (4293927648).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2067409152 is a wasteful number, since it uses less digits than its factorization.
2067409152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 693 (or 676 counting only the distinct ones).
The product of its (nonzero) digits is 30240, while the sum is 36.
The square root of 2067409152 is about 45468.7711731909. The cubic root of 2067409152 is about 1273.9199675020.
It can be divided in two parts, 2067409 and 152, that added together give a triangular number (2067561 = T2033).
The spelling of 2067409152 in words is "two billion, sixty-seven million, four hundred nine thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •