Base | Representation |
---|---|
bin | 1100011011010… |
… | …01001100101001 |
3 | 21021010221021112 |
4 | 12031221030221 |
5 | 203141134123 |
6 | 14202120105 |
7 | 2404011311 |
oct | 615511451 |
9 | 237127245 |
10 | 104239913 |
11 | 53927a98 |
12 | 2aab0035 |
13 | 1879962b |
14 | dbb6441 |
15 | 9240d78 |
hex | 6369329 |
104239913 has 2 divisors, whose sum is σ = 104239914. Its totient is φ = 104239912.
The previous prime is 104239859. The next prime is 104239931. The reversal of 104239913 is 319932401.
Together with next prime (104239931) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 85895824 + 18344089 = 9268^2 + 4283^2 .
It is a cyclic number.
It is not a de Polignac number, because 104239913 - 210 = 104238889 is a prime.
It is a nialpdrome in base 14.
It is a self number, because there is not a number n which added to its sum of digits gives 104239913.
It is not a weakly prime, because it can be changed into another prime (104239943) 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, 52119956 + 52119957.
It is an arithmetic number, because the mean of its divisors is an integer number (52119957).
Almost surely, 2104239913 is an apocalyptic number.
It is an amenable number.
104239913 is a deficient number, since it is larger than the sum of its proper divisors (1).
104239913 is an equidigital number, since it uses as much as digits as its factorization.
104239913 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5832, while the sum is 32.
The square root of 104239913 is about 10209.7949538666. The cubic root of 104239913 is about 470.6282725032.
The spelling of 104239913 in words is "one hundred four million, two hundred thirty-nine thousand, nine hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •