Base | Representation |
---|---|
bin | 1100011001101… |
… | …10101111000101 |
3 | 21020202102202021 |
4 | 12030312233011 |
5 | 203113030341 |
6 | 14153443141 |
7 | 2402160565 |
oct | 614665705 |
9 | 236672667 |
10 | 104033221 |
11 | 537a6776 |
12 | 2aa104b1 |
13 | 18726526 |
14 | db60da5 |
15 | 91ee9d1 |
hex | 6336bc5 |
104033221 has 2 divisors, whose sum is σ = 104033222. Its totient is φ = 104033220.
The previous prime is 104033219. The next prime is 104033261. The reversal of 104033221 is 122330401.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 92736900 + 11296321 = 9630^2 + 3361^2 .
It is a cyclic number.
It is not a de Polignac number, because 104033221 - 21 = 104033219 is a prime.
It is a super-2 number, since 2×1040332212 = 21645822143269682, which contains 22 as substring.
Together with 104033219, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 104033195 and 104033204.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (104033201) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52016610 + 52016611.
It is an arithmetic number, because the mean of its divisors is an integer number (52016611).
Almost surely, 2104033221 is an apocalyptic number.
It is an amenable number.
104033221 is a deficient number, since it is larger than the sum of its proper divisors (1).
104033221 is an equidigital number, since it uses as much as digits as its factorization.
104033221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 16.
The square root of 104033221 is about 10199.6676906652. The cubic root of 104033221 is about 470.3170050914.
Adding to 104033221 its reverse (122330401), we get a palindrome (226363622).
The spelling of 104033221 in words is "one hundred four million, thirty-three thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •