Base | Representation |
---|---|
bin | 1000011011100101001101 |
3 | 11011021201111 |
4 | 20123211031 |
5 | 1031211000 |
6 | 115212021 |
7 | 24533341 |
oct | 10334515 |
9 | 4137644 |
10 | 2210125 |
11 | 127a555 |
12 | 8a7011 |
13 | 5c4c88 |
14 | 417621 |
15 | 2d9cba |
hex | 21b94d |
2210125 has 8 divisors (see below), whose sum is σ = 2758392. Its totient is φ = 1768000.
The previous prime is 2210107. The next prime is 2210141. The reversal of 2210125 is 5210122.
2210125 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 233289 + 1976836 = 483^2 + 1406^2 .
It is not a de Polignac number, because 2210125 - 27 = 2209997 is a prime.
It is an Ulam number.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
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 in 7 ways as a sum of consecutive naturals, for example, 8716 + ... + 8965.
It is an arithmetic number, because the mean of its divisors is an integer number (344799).
22210125 is an apocalyptic number.
2210125 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
2210125 is a deficient number, since it is larger than the sum of its proper divisors (548267).
2210125 is an equidigital number, since it uses as much as digits as its factorization.
2210125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17696 (or 17686 counting only the distinct ones).
The product of its (nonzero) digits is 40, while the sum is 13.
The square root of 2210125 is about 1486.6489161870. The cubic root of 2210125 is about 130.2583619311.
Adding to 2210125 its reverse (5210122), we get a palindrome (7420247).
The spelling of 2210125 in words is "two million, two hundred ten thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •