Base | Representation |
---|---|
bin | 100000111011110… |
… | …1101111101100101 |
3 | 2212000111011210202 |
4 | 1001313231331211 |
5 | 4230403001341 |
6 | 301354400245 |
7 | 36246260264 |
oct | 10167557545 |
9 | 2760434722 |
10 | 1105125221 |
11 | 5178a5a32 |
12 | 26a130085 |
13 | 147c56765 |
14 | a6ab45db |
15 | 6704979b |
hex | 41dedf65 |
1105125221 has 2 divisors, whose sum is σ = 1105125222. Its totient is φ = 1105125220.
The previous prime is 1105125181. The next prime is 1105125251. The reversal of 1105125221 is 1225215011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1039353121 + 65772100 = 32239^2 + 8110^2 .
It is an emirp because it is prime and its reverse (1225215011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1105125221 - 26 = 1105125157 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1105125193 and 1105125202.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1105125251) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 552562610 + 552562611.
It is an arithmetic number, because the mean of its divisors is an integer number (552562611).
Almost surely, 21105125221 is an apocalyptic number.
It is an amenable number.
1105125221 is a deficient number, since it is larger than the sum of its proper divisors (1).
1105125221 is an equidigital number, since it uses as much as digits as its factorization.
1105125221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 200, while the sum is 20.
The square root of 1105125221 is about 33243.4237256032. The cubic root of 1105125221 is about 1033.8808633393.
The spelling of 1105125221 in words is "one billion, one hundred five million, one hundred twenty-five thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •