Base | Representation |
---|---|
bin | 1100011101010… |
… | …00011010101001 |
3 | 21021122002111001 |
4 | 12032220122221 |
5 | 203222430412 |
6 | 14211435001 |
7 | 2406140251 |
oct | 616503251 |
9 | 237562431 |
10 | 104498857 |
11 | 53a945a1 |
12 | 2abb5a61 |
13 | 1885a458 |
14 | dc42961 |
15 | 9292957 |
hex | 63a86a9 |
104498857 has 2 divisors, whose sum is σ = 104498858. Its totient is φ = 104498856.
The previous prime is 104498839. The next prime is 104498887. The reversal of 104498857 is 758894401.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 101989801 + 2509056 = 10099^2 + 1584^2 .
It is a cyclic number.
It is not a de Polignac number, because 104498857 - 211 = 104496809 is a prime.
It is a super-2 number, since 2×1044988572 = 21840022228612898, which contains 22 as substring.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (104498887) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52249428 + 52249429.
It is an arithmetic number, because the mean of its divisors is an integer number (52249429).
Almost surely, 2104498857 is an apocalyptic number.
It is an amenable number.
104498857 is a deficient number, since it is larger than the sum of its proper divisors (1).
104498857 is an equidigital number, since it uses as much as digits as its factorization.
104498857 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 322560, while the sum is 46.
The square root of 104498857 is about 10222.4682440201. The cubic root of 104498857 is about 471.0176486160.
It can be divided in two parts, 10449 and 8857, that added together give a triangular number (19306 = T196).
The spelling of 104498857 in words is "one hundred four million, four hundred ninety-eight thousand, eight hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •