Base | Representation |
---|---|
bin | 111110101110100… |
… | …010001000001000 |
3 | 2201100020201220212 |
4 | 332232202020020 |
5 | 4123402321200 |
6 | 252232140252 |
7 | 35036063114 |
oct | 7656421010 |
9 | 2640221825 |
10 | 1052385800 |
11 | 4a0054034 |
12 | 254537688 |
13 | 13a04c4bb |
14 | 9daa6744 |
15 | 625cd035 |
hex | 3eba2208 |
1052385800 has 48 divisors (see below), whose sum is σ = 2449287060. Its totient is φ = 420526080.
The previous prime is 1052385797. The next prime is 1052385809. The reversal of 1052385800 is 85832501.
It is a happy number.
It can be written as a sum of positive squares in 6 ways, for example, as 759222916 + 293162884 = 27554^2 + 17122^2 .
It is a super-2 number, since 2×10523858002 = 2215031744083280000, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1052385809) 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 11 ways as a sum of consecutive naturals, for example, 257372 + ... + 261428.
Almost surely, 21052385800 is an apocalyptic number.
1052385800 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1052385800 is an abundant number, since it is smaller than the sum of its proper divisors (1396901260).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1052385800 is a wasteful number, since it uses less digits than its factorization.
1052385800 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5370 (or 5361 counting only the distinct ones).
The product of its (nonzero) digits is 9600, while the sum is 32.
The square root of 1052385800 is about 32440.4962970667. The cubic root of 1052385800 is about 1017.1655898680.
The spelling of 1052385800 in words is "one billion, fifty-two million, three hundred eighty-five thousand, eight hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •