Base | Representation |
---|---|
bin | 1100011011111… |
… | …10101100010101 |
3 | 21021022102001102 |
4 | 12031332230111 |
5 | 203201443312 |
6 | 14204035445 |
7 | 2404526066 |
oct | 615765425 |
9 | 237272042 |
10 | 104327957 |
11 | 53988158 |
12 | 2ab32b85 |
13 | 187ca726 |
14 | dbda56d |
15 | 925bec2 |
hex | 637eb15 |
104327957 has 2 divisors, whose sum is σ = 104327958. Its totient is φ = 104327956.
The previous prime is 104327941. The next prime is 104327969. The reversal of 104327957 is 759723401.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 91661476 + 12666481 = 9574^2 + 3559^2 .
It is a cyclic number.
It is not a de Polignac number, because 104327957 - 24 = 104327941 is a prime.
It is a super-2 number, since 2×1043279572 = 21768645223587698, which contains 22 as substring.
It is a Chen prime.
It is equal to p5996342 and since 104327957 and 5996342 have the same sum of digits, it is a Honaker prime.
It is a self number, because there is not a number n which added to its sum of digits gives 104327957.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (104327557) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52163978 + 52163979.
It is an arithmetic number, because the mean of its divisors is an integer number (52163979).
Almost surely, 2104327957 is an apocalyptic number.
It is an amenable number.
104327957 is a deficient number, since it is larger than the sum of its proper divisors (1).
104327957 is an equidigital number, since it uses as much as digits as its factorization.
104327957 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 52920, while the sum is 38.
The square root of 104327957 is about 10214.1057856280. The cubic root of 104327957 is about 470.7607372309.
The spelling of 104327957 in words is "one hundred four million, three hundred twenty-seven thousand, nine hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •