Base | Representation |
---|---|
bin | 100000111001110… |
… | …1001011101110101 |
3 | 2211221110222011112 |
4 | 1001303221131311 |
5 | 4230114330404 |
6 | 301315444405 |
7 | 36234224441 |
oct | 10163513565 |
9 | 2757428145 |
10 | 1104058229 |
11 | 51723731a |
12 | 2698b6705 |
13 | 147971bc1 |
14 | a68b7821 |
15 | 66dd856e |
hex | 41ce9775 |
1104058229 has 2 divisors, whose sum is σ = 1104058230. Its totient is φ = 1104058228.
The previous prime is 1104058199. The next prime is 1104058243. The reversal of 1104058229 is 9228504011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1061782225 + 42276004 = 32585^2 + 6502^2 .
It is a cyclic number.
It is not a de Polignac number, because 1104058229 - 216 = 1103992693 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1104058195 and 1104058204.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1104058129) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 552029114 + 552029115.
It is an arithmetic number, because the mean of its divisors is an integer number (552029115).
Almost surely, 21104058229 is an apocalyptic number.
It is an amenable number.
1104058229 is a deficient number, since it is larger than the sum of its proper divisors (1).
1104058229 is an equidigital number, since it uses as much as digits as its factorization.
1104058229 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5760, while the sum is 32.
The square root of 1104058229 is about 33227.3716835984. The cubic root of 1104058229 is about 1033.5480208687.
The spelling of 1104058229 in words is "one billion, one hundred four million, fifty-eight thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.029 sec. • engine limits •