Base | Representation |
---|---|
bin | 100000011010… |
… | …000000100101 |
3 | 120222121010212 |
4 | 200122000211 |
5 | 4133321031 |
6 | 502025205 |
7 | 132131114 |
oct | 40320045 |
9 | 16877125 |
10 | 8495141 |
11 | 4882586 |
12 | 2a18205 |
13 | 19b5915 |
14 | 11b1c7b |
15 | b2c12b |
hex | 81a025 |
8495141 has 2 divisors, whose sum is σ = 8495142. Its totient is φ = 8495140.
The previous prime is 8495129. The next prime is 8495177. The reversal of 8495141 is 1415948.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5982916 + 2512225 = 2446^2 + 1585^2 .
It is a cyclic number.
It is not a de Polignac number, because 8495141 - 222 = 4300837 is a prime.
It is a Sophie Germain prime.
It is a Chen prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 8495098 and 8495107.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (8495101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 4247570 + 4247571.
It is an arithmetic number, because the mean of its divisors is an integer number (4247571).
Almost surely, 28495141 is an apocalyptic number.
It is an amenable number.
8495141 is a deficient number, since it is larger than the sum of its proper divisors (1).
8495141 is an equidigital number, since it uses as much as digits as its factorization.
8495141 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 5760, while the sum is 32.
The square root of 8495141 is about 2914.6425166734. The cubic root of 8495141 is about 204.0438599146.
The spelling of 8495141 in words is "eight million, four hundred ninety-five thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •