Base | Representation |
---|---|
bin | 1100100000010… |
… | …00111110010001 |
3 | 21022101012000001 |
4 | 12100020332101 |
5 | 203323104403 |
6 | 14224130001 |
7 | 2412405304 |
oct | 620107621 |
9 | 238335001 |
10 | 104894353 |
11 | 54234753 |
12 | 2b166901 |
13 | 18968485 |
14 | dd06b3b |
15 | 931ec1d |
hex | 6408f91 |
104894353 has 2 divisors, whose sum is σ = 104894354. Its totient is φ = 104894352.
The previous prime is 104894351. The next prime is 104894381. The reversal of 104894353 is 353498401.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 100942209 + 3952144 = 10047^2 + 1988^2 .
It is a cyclic number.
It is not a de Polignac number, because 104894353 - 21 = 104894351 is a prime.
It is a super-2 number, since 2×1048943532 = 22005650582577218, which contains 22 as substring.
Together with 104894351, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (104894351) 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, 52447176 + 52447177.
It is an arithmetic number, because the mean of its divisors is an integer number (52447177).
Almost surely, 2104894353 is an apocalyptic number.
It is an amenable number.
104894353 is a deficient number, since it is larger than the sum of its proper divisors (1).
104894353 is an equidigital number, since it uses as much as digits as its factorization.
104894353 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 51840, while the sum is 37.
The square root of 104894353 is about 10241.7944228538. The cubic root of 104894353 is about 471.6111194698.
The spelling of 104894353 in words is "one hundred four million, eight hundred ninety-four thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •