Search a number
-
+
10092676031 is a prime number
BaseRepresentation
bin10010110011001001…
…00000001110111111
3222001101011001201222
421121210200032333
5131132211113111
64345253023555
7505051221314
oct113144401677
928041131658
1010092676031
11430a063979
121b58024bbb
13c4ac68469
146ba5a8d0b
153e10b77db
hex2599203bf

10092676031 has 2 divisors, whose sum is σ = 10092676032. Its totient is φ = 10092676030.

The previous prime is 10092676003. The next prime is 10092676039. The reversal of 10092676031 is 13067629001.

10092676031 is digitally balanced in base 2 and base 3, because in such bases it contains all the possibile digits an equal number of times.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 10092676031 - 222 = 10088481727 is a prime.

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

It is a Sophie Germain prime.

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

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

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

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

Almost surely, 210092676031 is an apocalyptic number.

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

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

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

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

The spelling of 10092676031 in words is "ten billion, ninety-two million, six hundred seventy-six thousand, thirty-one".