Base | Representation |
---|---|
bin | 111110100010101… |
… | …101000010010000 |
3 | 2201010102012002020 |
4 | 332202231002100 |
5 | 4122104103002 |
6 | 252041451440 |
7 | 35000526135 |
oct | 7642550220 |
9 | 2633365066 |
10 | 1049284752 |
11 | 49932618a |
12 | 2534a0b80 |
13 | 139504b69 |
14 | 9d4da58c |
15 | 621b92bc |
hex | 3e8ad090 |
1049284752 has 20 divisors (see below), whose sum is σ = 2710652400. Its totient is φ = 349761568.
The previous prime is 1049284741. The next prime is 1049284759. The reversal of 1049284752 is 2574829401.
It is a super-2 number, since 2×10492847522 = 2201996981559403008, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1049284759) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 10930002 + ... + 10930097.
It is an arithmetic number, because the mean of its divisors is an integer number (135532620).
Almost surely, 21049284752 is an apocalyptic number.
1049284752 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1049284752 is an abundant number, since it is smaller than the sum of its proper divisors (1661367648).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1049284752 is a wasteful number, since it uses less digits than its factorization.
1049284752 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21860110 (or 21860104 counting only the distinct ones).
The product of its (nonzero) digits is 161280, while the sum is 42.
The square root of 1049284752 is about 32392.6650956663. The cubic root of 1049284752 is about 1016.1655185313.
The spelling of 1049284752 in words is "one billion, forty-nine million, two hundred eighty-four thousand, seven hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •