Base | Representation |
---|---|
bin | 101000001000… |
… | …100111011101 |
3 | 201210112011122 |
4 | 220020213131 |
5 | 10143133203 |
6 | 1013300325 |
7 | 155266424 |
oct | 50104735 |
9 | 21715148 |
10 | 10521053 |
11 | 5a36694 |
12 | 36346a5 |
13 | 2244a9a |
14 | 157c2bb |
15 | dcc538 |
hex | a089dd |
10521053 has 2 divisors, whose sum is σ = 10521054. Its totient is φ = 10521052.
The previous prime is 10521031. The next prime is 10521089. The reversal of 10521053 is 35012501.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5583769 + 4937284 = 2363^2 + 2222^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10521053 is a prime.
It is a super-2 number, since 2×105210532 = 221385112457618, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10521013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5260526 + 5260527.
It is an arithmetic number, because the mean of its divisors is an integer number (5260527).
Almost surely, 210521053 is an apocalyptic number.
It is an amenable number.
10521053 is a deficient number, since it is larger than the sum of its proper divisors (1).
10521053 is an equidigital number, since it uses as much as digits as its factorization.
10521053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 150, while the sum is 17.
The square root of 10521053 is about 3243.6172708876. The cubic root of 10521053 is about 219.1222116958.
Adding to 10521053 its reverse (35012501), we get a palindrome (45533554).
It can be divided in two parts, 105210 and 53, that multiplied together give a triangular number (5576130 = T3339).
The spelling of 10521053 in words is "ten million, five hundred twenty-one thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •