Base | Representation |
---|---|
bin | 1100100000010… |
… | …00010000110001 |
3 | 21022101001000012 |
4 | 12100020100301 |
5 | 203323011231 |
6 | 14224104305 |
7 | 2412363644 |
oct | 620102061 |
9 | 238331005 |
10 | 104891441 |
11 | 54232546 |
12 | 2b165095 |
13 | 18967055 |
14 | dd05a5b |
15 | 931de2b |
hex | 6408431 |
104891441 has 2 divisors, whose sum is σ = 104891442. Its totient is φ = 104891440.
The previous prime is 104891401. The next prime is 104891461. The reversal of 104891441 is 144198401.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 54538225 + 50353216 = 7385^2 + 7096^2 .
It is an emirp because it is prime and its reverse (144198401) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 104891441 - 218 = 104629297 is a prime.
It is a super-2 number, since 2×1048914412 = 22004428790112962, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Chen prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 104891398 and 104891407.
It is not a weakly prime, because it can be changed into another prime (104891401) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52445720 + 52445721.
It is an arithmetic number, because the mean of its divisors is an integer number (52445721).
Almost surely, 2104891441 is an apocalyptic number.
It is an amenable number.
104891441 is a deficient number, since it is larger than the sum of its proper divisors (1).
104891441 is an equidigital number, since it uses as much as digits as its factorization.
104891441 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4608, while the sum is 32.
The square root of 104891441 is about 10241.6522592793. The cubic root of 104891441 is about 471.6067552555.
The spelling of 104891441 in words is "one hundred four million, eight hundred ninety-one thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •