Search a number
-
+
10496131 is a prime number
BaseRepresentation
bin101000000010…
…100010000011
3201202020222121
4220002202003
510141334011
61012545111
7155133652
oct50024203
921666877
1010496131
115a19998
123622197
132236639
141573199
15dc4e71
hexa02883

10496131 has 2 divisors, whose sum is σ = 10496132. Its totient is φ = 10496130.

The previous prime is 10496099. The next prime is 10496149. The reversal of 10496131 is 13169401.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 10496131 - 25 = 10496099 is a prime.

It is a super-2 number, since 2×104961312 = 220337531938322, which contains 22 as substring.

It is a junction number, because it is equal to n+sod(n) for n = 10496096 and 10496105.

It is not a weakly prime, because it can be changed into another prime (10496831) 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, 5248065 + 5248066.

It is an arithmetic number, because the mean of its divisors is an integer number (5248066).

Almost surely, 210496131 is an apocalyptic number.

10496131 is a deficient number, since it is larger than the sum of its proper divisors (1).

10496131 is an equidigital number, since it uses as much as digits as its factorization.

10496131 is an odious number, because the sum of its binary digits is odd.

The product of its (nonzero) digits is 648, while the sum is 25.

The square root of 10496131 is about 3239.7732945378. The cubic root of 10496131 is about 218.9490578814.

The spelling of 10496131 in words is "ten million, four hundred ninety-six thousand, one hundred thirty-one".