Base | Representation |
---|---|
bin | 111110110010111… |
… | …110010111000101 |
3 | 2201102102212221011 |
4 | 332302332113011 |
5 | 4124202100041 |
6 | 252313122221 |
7 | 35052012256 |
oct | 7662762705 |
9 | 2642385834 |
10 | 1053550021 |
11 | 4a07797a7 |
12 | 2549b9371 |
13 | 13a3693a4 |
14 | 9dccab2d |
15 | 6275ce81 |
hex | 3ecbe5c5 |
1053550021 has 2 divisors, whose sum is σ = 1053550022. Its totient is φ = 1053550020.
The previous prime is 1053550007. The next prime is 1053550031. The reversal of 1053550021 is 1200553501.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 817159396 + 236390625 = 28586^2 + 15375^2 .
It is a cyclic number.
It is not a de Polignac number, because 1053550021 - 211 = 1053547973 is a prime.
It is a super-2 number, since 2×10535500212 = 2219935293498200882, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1053549974 and 1053550001.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1053550031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 526775010 + 526775011.
It is an arithmetic number, because the mean of its divisors is an integer number (526775011).
Almost surely, 21053550021 is an apocalyptic number.
It is an amenable number.
1053550021 is a deficient number, since it is larger than the sum of its proper divisors (1).
1053550021 is an equidigital number, since it uses as much as digits as its factorization.
1053550021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 750, while the sum is 22.
The square root of 1053550021 is about 32458.4352826811. The cubic root of 1053550021 is about 1017.5405376376.
The spelling of 1053550021 in words is "one billion, fifty-three million, five hundred fifty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •