Base | Representation |
---|---|
bin | 111110110001110… |
… | …011010101001100 |
3 | 2201101212021100220 |
4 | 332301303111030 |
5 | 4124112231300 |
6 | 252302351340 |
7 | 35046262266 |
oct | 7661632514 |
9 | 2641767326 |
10 | 1053242700 |
11 | 4a0589914 |
12 | 25488b550 |
13 | 13a28c543 |
14 | 9dc4ab36 |
15 | 626ebda0 |
hex | 3ec7354c |
1053242700 has 36 divisors (see below), whose sum is σ = 3047383080. Its totient is φ = 280864640.
The previous prime is 1053242683. The next prime is 1053242717. The reversal of 1053242700 is 72423501.
It is an interprime number because it is at equal distance from previous prime (1053242683) and next prime (1053242717).
It is a super-2 number, since 2×10532427002 = 2218640370206580000, which contains 22 as substring.
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 11 ways as a sum of consecutive naturals, for example, 1755105 + ... + 1755704.
It is an arithmetic number, because the mean of its divisors is an integer number (84649530).
Almost surely, 21053242700 is an apocalyptic number.
1053242700 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1053242700 is an abundant number, since it is smaller than the sum of its proper divisors (1994140380).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1053242700 is a wasteful number, since it uses less digits than its factorization.
1053242700 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3510826 (or 3510819 counting only the distinct ones).
The product of its (nonzero) digits is 1680, while the sum is 24.
The square root of 1053242700 is about 32453.7008675436. The cubic root of 1053242700 is about 1017.4415890099.
The spelling of 1053242700 in words is "one billion, fifty-three million, two hundred forty-two thousand, seven hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •