Base | Representation |
---|---|
bin | 1101001011100… |
… | …11001001100001 |
3 | 21201001122110001 |
4 | 12211303021201 |
5 | 211301302004 |
6 | 14545540001 |
7 | 2511563503 |
oct | 645631141 |
9 | 251048401 |
10 | 110572129 |
11 | 57462528 |
12 | 31044601 |
13 | 19ba58c5 |
14 | 10983d73 |
15 | 9a921a4 |
hex | 6973261 |
110572129 has 2 divisors, whose sum is σ = 110572130. Its totient is φ = 110572128.
The previous prime is 110572123. The next prime is 110572139. The reversal of 110572129 is 921275011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 107682129 + 2890000 = 10377^2 + 1700^2 .
It is a cyclic number.
It is not a de Polignac number, because 110572129 - 215 = 110539361 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 110572097 and 110572106.
It is not a weakly prime, because it can be changed into another prime (110572123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55286064 + 55286065.
It is an arithmetic number, because the mean of its divisors is an integer number (55286065).
Almost surely, 2110572129 is an apocalyptic number.
It is an amenable number.
110572129 is a deficient number, since it is larger than the sum of its proper divisors (1).
110572129 is an equidigital number, since it uses as much as digits as its factorization.
110572129 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1260, while the sum is 28.
The square root of 110572129 is about 10515.3282877902. The cubic root of 110572129 is about 479.9712497248.
The spelling of 110572129 in words is "one hundred ten million, five hundred seventy-two thousand, one hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •