Base | Representation |
---|---|
bin | 100000111010010… |
… | …1100011001111101 |
3 | 2211221222220021111 |
4 | 1001310230121331 |
5 | 4230202114123 |
6 | 301325402021 |
7 | 36236446012 |
oct | 10164543175 |
9 | 2757886244 |
10 | 1104332413 |
11 | 517404318 |
12 | 269a09311 |
13 | 147a39942 |
14 | a6949709 |
15 | 66e3e90d |
hex | 41d2c67d |
1104332413 has 2 divisors, whose sum is σ = 1104332414. Its totient is φ = 1104332412.
The previous prime is 1104332387. The next prime is 1104332431. The reversal of 1104332413 is 3142334011.
Together with next prime (1104332431) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 755315289 + 349017124 = 27483^2 + 18682^2 .
It is an emirp because it is prime and its reverse (3142334011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1104332413 - 29 = 1104331901 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1104332443) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 552166206 + 552166207.
It is an arithmetic number, because the mean of its divisors is an integer number (552166207).
Almost surely, 21104332413 is an apocalyptic number.
It is an amenable number.
1104332413 is a deficient number, since it is larger than the sum of its proper divisors (1).
1104332413 is an equidigital number, since it uses as much as digits as its factorization.
1104332413 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 864, while the sum is 22.
The square root of 1104332413 is about 33231.4973030106. The cubic root of 1104332413 is about 1033.6335715724.
Adding to 1104332413 its reverse (3142334011), we get a palindrome (4246666424).
The spelling of 1104332413 in words is "one billion, one hundred four million, three hundred thirty-two thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.386 sec. • engine limits •