Base | Representation |
---|---|
bin | 101000000010… |
… | …011111010101 |
3 | 201202020202011 |
4 | 220002133111 |
5 | 10141332312 |
6 | 1012544221 |
7 | 155133313 |
oct | 50023725 |
9 | 21666664 |
10 | 10495957 |
11 | 5a1984a |
12 | 3622071 |
13 | 2236534 |
14 | 15730b3 |
15 | dc4da7 |
hex | a027d5 |
10495957 has 2 divisors, whose sum is σ = 10495958. Its totient is φ = 10495956.
The previous prime is 10495943. The next prime is 10495967. The reversal of 10495957 is 75959401.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7447441 + 3048516 = 2729^2 + 1746^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10495957 is a prime.
It is a super-2 number, since 2×104959572 = 220330226691698, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10495907) 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, 5247978 + 5247979.
It is an arithmetic number, because the mean of its divisors is an integer number (5247979).
Almost surely, 210495957 is an apocalyptic number.
It is an amenable number.
10495957 is a deficient number, since it is larger than the sum of its proper divisors (1).
10495957 is an equidigital number, since it uses as much as digits as its factorization.
10495957 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 56700, while the sum is 40.
The square root of 10495957 is about 3239.7464406956. The cubic root of 10495957 is about 218.9478479960.
The spelling of 10495957 in words is "ten million, four hundred ninety-five thousand, nine hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •