Base | Representation |
---|---|
bin | 100001000101100… |
… | …1010000101000101 |
3 | 2212101002002001221 |
4 | 1002023022011011 |
5 | 4233204034000 |
6 | 302055520341 |
7 | 36340503166 |
oct | 10213120505 |
9 | 2771062057 |
10 | 1110221125 |
11 | 51a766622 |
12 | 26b9890b1 |
13 | 14901c0a0 |
14 | a763d76d |
15 | 6770461a |
hex | 422ca145 |
1110221125 has 32 divisors (see below), whose sum is σ = 1579949280. Its totient is φ = 771609600.
The previous prime is 1110221087. The next prime is 1110221141. The reversal of 1110221125 is 5211220111.
It can be written as a sum of positive squares in 16 ways, for example, as 1069682436 + 40538689 = 32706^2 + 6367^2 .
It is not a de Polignac number, because 1110221125 - 29 = 1110220613 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1110221099 and 1110221108.
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 31 ways as a sum of consecutive naturals, for example, 7531 + ... + 47719.
It is an arithmetic number, because the mean of its divisors is an integer number (49373415).
Almost surely, 21110221125 is an apocalyptic number.
It is an amenable number.
1110221125 is a deficient number, since it is larger than the sum of its proper divisors (469728155).
1110221125 is a wasteful number, since it uses less digits than its factorization.
1110221125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40234 (or 40224 counting only the distinct ones).
The product of its (nonzero) digits is 40, while the sum is 16.
The square root of 1110221125 is about 33319.9808673414. The cubic root of 1110221125 is about 1035.4675554061.
Adding to 1110221125 its reverse (5211220111), we get a palindrome (6321441236).
The spelling of 1110221125 in words is "one billion, one hundred ten million, two hundred twenty-one thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •