Base | Representation |
---|---|
bin | 100000111001111… |
… | …0110111001000101 |
3 | 2211221120202121021 |
4 | 1001303312321011 |
5 | 4230123110341 |
6 | 301320551141 |
7 | 36234543661 |
oct | 10163667105 |
9 | 2757522537 |
10 | 1104113221 |
11 | 517274672 |
12 | 2699224b1 |
13 | 147990c43 |
14 | a68cd8a1 |
15 | 66de99d1 |
hex | 41cf6e45 |
1104113221 has 2 divisors, whose sum is σ = 1104113222. Its totient is φ = 1104113220.
The previous prime is 1104113209. The next prime is 1104113233. The reversal of 1104113221 is 1223114011.
It is a balanced prime because it is at equal distance from previous prime (1104113209) and next prime (1104113233).
It can be written as a sum of positive squares in only one way, i.e., 558376900 + 545736321 = 23630^2 + 23361^2 .
It is a cyclic number.
It is not a de Polignac number, because 1104113221 - 217 = 1103982149 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1104113195 and 1104113204.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1104113281) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 552056610 + 552056611.
It is an arithmetic number, because the mean of its divisors is an integer number (552056611).
Almost surely, 21104113221 is an apocalyptic number.
It is an amenable number.
1104113221 is a deficient number, since it is larger than the sum of its proper divisors (1).
1104113221 is an equidigital number, since it uses as much as digits as its factorization.
1104113221 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 48, while the sum is 16.
The square root of 1104113221 is about 33228.1991838258. The cubic root of 1104113221 is about 1033.5651805703.
Adding to 1104113221 its reverse (1223114011), we get a palindrome (2327227232).
The spelling of 1104113221 in words is "one billion, one hundred four million, one hundred thirteen thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •