Base | Representation |
---|---|
bin | 100000111010100… |
… | …0111000001001101 |
3 | 2211222012102210211 |
4 | 1001311013001031 |
5 | 4230214111141 |
6 | 301332002421 |
7 | 36240411556 |
oct | 10165070115 |
9 | 2758172724 |
10 | 1104441421 |
11 | 517479206 |
12 | 269a60411 |
13 | 147a77445 |
14 | a697732d |
15 | 66e61d81 |
hex | 41d4704d |
1104441421 has 2 divisors, whose sum is σ = 1104441422. Its totient is φ = 1104441420.
The previous prime is 1104441413. The next prime is 1104441449. The reversal of 1104441421 is 1241444011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 833476900 + 270964521 = 28870^2 + 16461^2 .
It is a cyclic number.
It is not a de Polignac number, because 1104441421 - 23 = 1104441413 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1104441392 and 1104441401.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1104441451) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 552220710 + 552220711.
It is an arithmetic number, because the mean of its divisors is an integer number (552220711).
Almost surely, 21104441421 is an apocalyptic number.
It is an amenable number.
1104441421 is a deficient number, since it is larger than the sum of its proper divisors (1).
1104441421 is an equidigital number, since it uses as much as digits as its factorization.
1104441421 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 512, while the sum is 22.
The square root of 1104441421 is about 33233.1373932706. The cubic root of 1104441421 is about 1033.6675802398.
Adding to 1104441421 its reverse (1241444011), we get a palindrome (2345885432).
The spelling of 1104441421 in words is "one billion, one hundred four million, four hundred forty-one thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •