Base | Representation |
---|---|
bin | 111110010001110… |
… | …1110100111010000 |
3 | 12101122012211101122 |
4 | 1330203232213100 |
5 | 13234433201002 |
6 | 543210221412 |
7 | 102533334431 |
oct | 17443564720 |
9 | 5348184348 |
10 | 2089740752 |
11 | 982671180 |
12 | 4a3a24868 |
13 | 273c382b8 |
14 | 15b779488 |
15 | c36dc6a2 |
hex | 7c8ee9d0 |
2089740752 has 80 divisors (see below), whose sum is σ = 4574183424. Its totient is φ = 916272000.
The previous prime is 2089740733. The next prime is 2089740761. The reversal of 2089740752 is 2570479802.
It is a Harshad number since it is a multiple of its sum of digits (44).
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 15 ways as a sum of consecutive naturals, for example, 3311477 + ... + 3312107.
Almost surely, 22089740752 is an apocalyptic number.
2089740752 is a gapful number since it is divisible by the number (22) 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 2089740752, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2287091712).
2089740752 is an abundant number, since it is smaller than the sum of its proper divisors (2484442672).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2089740752 is a wasteful number, since it uses less digits than its factorization.
2089740752 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1288 (or 1282 counting only the distinct ones).
The product of its (nonzero) digits is 282240, while the sum is 44.
The square root of 2089740752 is about 45713.6823281608. The cubic root of 2089740752 is about 1278.4903980452.
The spelling of 2089740752 in words is "two billion, eighty-nine million, seven hundred forty thousand, seven hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •