Base | Representation |
---|---|
bin | 1100100000010… |
… | …01010110101001 |
3 | 21022101021010211 |
4 | 12100021112221 |
5 | 203323132123 |
6 | 14224141121 |
7 | 2412412663 |
oct | 620112651 |
9 | 238337124 |
10 | 104895913 |
11 | 54235941 |
12 | 2b1677a1 |
13 | 189690b5 |
14 | dd07533 |
15 | 932040d |
hex | 64095a9 |
104895913 has 2 divisors, whose sum is σ = 104895914. Its totient is φ = 104895912.
The previous prime is 104895887. The next prime is 104895949. The reversal of 104895913 is 319598401.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 102576384 + 2319529 = 10128^2 + 1523^2 .
It is a cyclic number.
It is not a de Polignac number, because 104895913 - 25 = 104895881 is a prime.
It is a super-2 number, since 2×1048959132 = 22006305128207138, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (104895953) 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, 52447956 + 52447957.
It is an arithmetic number, because the mean of its divisors is an integer number (52447957).
Almost surely, 2104895913 is an apocalyptic number.
It is an amenable number.
104895913 is a deficient number, since it is larger than the sum of its proper divisors (1).
104895913 is an equidigital number, since it uses as much as digits as its factorization.
104895913 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 38880, while the sum is 40.
The square root of 104895913 is about 10241.8705810999. The cubic root of 104895913 is about 471.6134574085.
The spelling of 104895913 in words is "one hundred four million, eight hundred ninety-five thousand, nine hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •