Base | Representation |
---|---|
bin | 101000001111… |
… | …0011010111101 |
3 | 1110200210102222 |
4 | 1100132122331 |
5 | 20400034000 |
6 | 2032055125 |
7 | 344212511 |
oct | 120363275 |
9 | 43623388 |
10 | 21096125 |
11 | 109a9916 |
12 | 70944a5 |
13 | 44a831b |
14 | 2b32141 |
15 | 1cbaa85 |
hex | 141e6bd |
21096125 has 8 divisors (see below), whose sum is σ = 26328120. Its totient is φ = 16876800.
The previous prime is 21096121. The next prime is 21096143. The reversal of 21096125 is 52169012.
It can be written as a sum of positive squares in 4 ways, for example, as 502681 + 20593444 = 709^2 + 4538^2 .
It is not a de Polignac number, because 21096125 - 22 = 21096121 is a prime.
It is an alternating number because its digits alternate between even and odd.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 21096094 and 21096103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21096121) 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, 84260 + ... + 84509.
It is an arithmetic number, because the mean of its divisors is an integer number (3291015).
Almost surely, 221096125 is an apocalyptic number.
21096125 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
21096125 is a deficient number, since it is larger than the sum of its proper divisors (5231995).
21096125 is an equidigital number, since it uses as much as digits as its factorization.
21096125 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 168784 (or 168774 counting only the distinct ones).
The product of its (nonzero) digits is 1080, while the sum is 26.
The square root of 21096125 is about 4593.0518176916. The cubic root of 21096125 is about 276.3127318753.
The spelling of 21096125 in words is "twenty-one million, ninety-six thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •