Search a number
-
+
10246931531 is a prime number
BaseRepresentation
bin10011000101100001…
…11100010001001011
3222110010102001111122
421202300330101023
5131441203302111
64412443145455
7511633323644
oct114260742113
928403361448
1010246931531
114389142361
121b9b81528b
13c73bc72c5
146d2c806cb
153ee8d7cdb
hex262c3c44b

10246931531 has 2 divisors, whose sum is σ = 10246931532. Its totient is φ = 10246931530.

The previous prime is 10246931501. The next prime is 10246931533. The reversal of 10246931531 is 13513964201.

It is a strong prime.

It is an emirp because it is prime and its reverse (13513964201) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 10246931531 - 218 = 10246669387 is a prime.

It is a super-2 number, since 2×102469315312 (a number of 21 digits) contains 22 as substring.

It is a Sophie Germain prime.

Together with 10246931533, it forms a pair of twin primes.

It is a Chen prime.

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

It is not a weakly prime, because it can be changed into another prime (10246931533) by changing a digit.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5123465765 + 5123465766.

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

Almost surely, 210246931531 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 19440, while the sum is 35.

The spelling of 10246931531 in words is "ten billion, two hundred forty-six million, nine hundred thirty-one thousand, five hundred thirty-one".