Base | Representation |
---|---|
bin | 111110111001010… |
… | …001110011011000 |
3 | 2201112112211201211 |
4 | 332321101303120 |
5 | 4130112440040 |
6 | 252412352504 |
7 | 35102034121 |
oct | 7671216330 |
9 | 2645484654 |
10 | 1055202520 |
11 | 4a16a82a9 |
12 | 255475734 |
13 | 13a7c75b8 |
14 | a01db048 |
15 | 629878ea |
hex | 3ee51cd8 |
1055202520 has 16 divisors (see below), whose sum is σ = 2374205760. Its totient is φ = 422080992.
The previous prime is 1055202503. The next prime is 1055202539. The reversal of 1055202520 is 252025501.
It is a super-2 number, since 2×10552025202 = 2226904716428700800, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1055202491 and 1055202500.
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 3 ways as a sum of consecutive naturals, for example, 13189992 + ... + 13190071.
It is an arithmetic number, because the mean of its divisors is an integer number (148387860).
Almost surely, 21055202520 is an apocalyptic number.
1055202520 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1055202520 is an abundant number, since it is smaller than the sum of its proper divisors (1319003240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1055202520 is a wasteful number, since it uses less digits than its factorization.
1055202520 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26380074 (or 26380070 counting only the distinct ones).
The product of its (nonzero) digits is 1000, while the sum is 22.
The square root of 1055202520 is about 32483.8809257761. The cubic root of 1055202520 is about 1018.0722657041.
The spelling of 1055202520 in words is "one billion, fifty-five million, two hundred two thousand, five hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •