Base | Representation |
---|---|
bin | 1100100000100… |
… | …10011011111001 |
3 | 21022110011011121 |
4 | 12100102123321 |
5 | 203330324423 |
6 | 14225025241 |
7 | 2412626305 |
oct | 620223371 |
9 | 238404147 |
10 | 104933113 |
11 | 5426088a |
12 | 2b185221 |
13 | 1897cccc |
14 | dd16d05 |
15 | 932b45d |
hex | 64126f9 |
104933113 has 2 divisors, whose sum is σ = 104933114. Its totient is φ = 104933112.
The previous prime is 104933077. The next prime is 104933117. The reversal of 104933113 is 311339401.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 85599504 + 19333609 = 9252^2 + 4397^2 .
It is a cyclic number.
It is not a de Polignac number, because 104933113 - 213 = 104924921 is a prime.
It is a super-2 number, since 2×1049331132 = 22021916407741538, which contains 22 as substring.
It is equal to p6029053 and since 104933113 and 6029053 have the same sum of digits, it is a Honaker prime.
It is not a weakly prime, because it can be changed into another prime (104933117) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a good prime.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52466556 + 52466557.
It is an arithmetic number, because the mean of its divisors is an integer number (52466557).
Almost surely, 2104933113 is an apocalyptic number.
It is an amenable number.
104933113 is a deficient number, since it is larger than the sum of its proper divisors (1).
104933113 is an equidigital number, since it uses as much as digits as its factorization.
104933113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 972, while the sum is 25.
The square root of 104933113 is about 10243.6864946171. The cubic root of 104933113 is about 471.6692013887.
The spelling of 104933113 in words is "one hundred four million, nine hundred thirty-three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •