Base | Representation |
---|---|
bin | 111100110010101… |
… | …1111000100111000 |
3 | 12021011101010020120 |
4 | 1321211133010320 |
5 | 13134201313002 |
6 | 534225253240 |
7 | 101356415064 |
oct | 17145370470 |
9 | 5234333216 |
10 | 2039869752 |
11 | 9574a9378 |
12 | 48b194220 |
13 | 2667c682b |
14 | 154cb6aa4 |
15 | be13acbc |
hex | 7995f138 |
2039869752 has 32 divisors (see below), whose sum is σ = 5161121280. Its totient is φ = 671763680.
The previous prime is 2039869723. The next prime is 2039869753. The reversal of 2039869752 is 2579689302.
It is a super-2 number, since 2×20398697522 = 8322137210249083008, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2039869695 and 2039869704.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2039869753) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 510024 + ... + 514007.
It is an arithmetic number, because the mean of its divisors is an integer number (161285040).
Almost surely, 22039869752 is an apocalyptic number.
It is an amenable number.
2039869752 is an abundant number, since it is smaller than the sum of its proper divisors (3121251528).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2039869752 is a wasteful number, since it uses less digits than its factorization.
2039869752 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1024123 (or 1024119 counting only the distinct ones).
The product of its (nonzero) digits is 1632960, while the sum is 51.
The square root of 2039869752 is about 45164.9172699342. The cubic root of 2039869752 is about 1268.2381488362.
The spelling of 2039869752 in words is "two billion, thirty-nine million, eight hundred sixty-nine thousand, seven hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •