Base | Representation |
---|---|
bin | 101000010000… |
… | …001100111101 |
3 | 201212002210110 |
4 | 220100030331 |
5 | 10200132000 |
6 | 1014100233 |
7 | 155456133 |
oct | 50201475 |
9 | 21762713 |
10 | 10552125 |
11 | 5a57a71 |
12 | 364a679 |
13 | 2255c7c |
14 | 1589753 |
15 | dd6850 |
hex | a1033d |
10552125 has 32 divisors (see below), whose sum is σ = 18495360. Its totient is φ = 5328000.
The previous prime is 10552123. The next prime is 10552133. The reversal of 10552125 is 52125501.
10552125 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10552125 - 21 = 10552123 is a prime.
It is a super-2 number, since 2×105521252 = 222694684031250, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10552123) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 6385 + ... + 7865.
It is an arithmetic number, because the mean of its divisors is an integer number (577980).
Almost surely, 210552125 is an apocalyptic number.
10552125 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
10552125 is a deficient number, since it is larger than the sum of its proper divisors (7943235).
10552125 is a wasteful number, since it uses less digits than its factorization.
10552125 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1518 (or 1508 counting only the distinct ones).
The product of its (nonzero) digits is 500, while the sum is 21.
The square root of 10552125 is about 3248.4034540063. The cubic root of 10552125 is about 219.3377121063.
Adding to 10552125 its reverse (52125501), we get a palindrome (62677626).
The spelling of 10552125 in words is "ten million, five hundred fifty-two thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •