Base | Representation |
---|---|
bin | 111110111001010… |
… | …100001111101001 |
3 | 2201112120100110020 |
4 | 332321110033221 |
5 | 4130113300041 |
6 | 252412511053 |
7 | 35102105226 |
oct | 7671241751 |
9 | 2645510406 |
10 | 1055212521 |
11 | 4a1704870 |
12 | 25547b489 |
13 | 13a7cc00c |
14 | a020094d |
15 | 6298a866 |
hex | 3ee543e9 |
1055212521 has 8 divisors (see below), whose sum is σ = 1534854624. Its totient is φ = 639522720.
The previous prime is 1055212517. The next prime is 1055212537. The reversal of 1055212521 is 1252125501.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1055212521 - 22 = 1055212517 is a prime.
It is a super-2 number, since 2×10552125212 = 2226946928950350882, which contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1055212491 and 1055212500.
It is not an unprimeable number, because it can be changed into a prime (1055210521) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 15988036 + ... + 15988101.
It is an arithmetic number, because the mean of its divisors is an integer number (191856828).
Almost surely, 21055212521 is an apocalyptic number.
1055212521 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1055212521 is a deficient number, since it is larger than the sum of its proper divisors (479642103).
1055212521 is a wasteful number, since it uses less digits than its factorization.
1055212521 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 31976151.
The product of its (nonzero) digits is 1000, while the sum is 24.
The square root of 1055212521 is about 32484.0348632986. The cubic root of 1055212521 is about 1018.0754820562.
The spelling of 1055212521 in words is "one billion, fifty-five million, two hundred twelve thousand, five hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •