Base | Representation |
---|---|
bin | 1100100000000… |
… | …01100010111101 |
3 | 21022022122021101 |
4 | 12100001202331 |
5 | 203321121213 |
6 | 14223333101 |
7 | 2412220516 |
oct | 620014275 |
9 | 238278241 |
10 | 104863933 |
11 | 54213909 |
12 | 2b151191 |
13 | 18957685 |
14 | dcd9a0d |
15 | 9315bdd |
hex | 64018bd |
104863933 has 2 divisors, whose sum is σ = 104863934. Its totient is φ = 104863932.
The previous prime is 104863903. The next prime is 104863951. The reversal of 104863933 is 339368401.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 91336249 + 13527684 = 9557^2 + 3678^2 .
It is a cyclic number.
It is not a de Polignac number, because 104863933 - 25 = 104863901 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 104863892 and 104863901.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (104863903) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52431966 + 52431967.
It is an arithmetic number, because the mean of its divisors is an integer number (52431967).
Almost surely, 2104863933 is an apocalyptic number.
It is an amenable number.
104863933 is a deficient number, since it is larger than the sum of its proper divisors (1).
104863933 is an equidigital number, since it uses as much as digits as its factorization.
104863933 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 46656, while the sum is 37.
The square root of 104863933 is about 10240.3092238467. The cubic root of 104863933 is about 471.5655250315.
The spelling of 104863933 in words is "one hundred four million, eight hundred sixty-three thousand, nine hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •