Base | Representation |
---|---|
bin | 1100011100000… |
… | …00000010000001 |
3 | 21021022200120112 |
4 | 12032000002001 |
5 | 203202132231 |
6 | 14204121105 |
7 | 2404551062 |
oct | 616000201 |
9 | 237280515 |
10 | 104333441 |
11 | 53991293 |
12 | 2ab36195 |
13 | 18800084 |
14 | dbdc569 |
15 | 925d92b |
hex | 6380081 |
104333441 has 2 divisors, whose sum is σ = 104333442. Its totient is φ = 104333440.
The previous prime is 104333431. The next prime is 104333443. The reversal of 104333441 is 144333401.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 103530625 + 802816 = 10175^2 + 896^2 .
It is an emirp because it is prime and its reverse (144333401) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-104333441 is a prime.
Together with 104333443, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (104333443) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52166720 + 52166721.
It is an arithmetic number, because the mean of its divisors is an integer number (52166721).
Almost surely, 2104333441 is an apocalyptic number.
It is an amenable number.
104333441 is a deficient number, since it is larger than the sum of its proper divisors (1).
104333441 is an equidigital number, since it uses as much as digits as its factorization.
104333441 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1728, while the sum is 23.
The square root of 104333441 is about 10214.3742343817. The cubic root of 104333441 is about 470.7689856006.
Adding to 104333441 its reverse (144333401), we get a palindrome (248666842).
The spelling of 104333441 in words is "one hundred four million, three hundred thirty-three thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •