Search a number
-
+
10150681531 is a prime number
BaseRepresentation
bin10010111010000011…
…10001101110111011
3222012102022001022211
421131001301232323
5131242033302111
64355124155551
7506354240464
oct113501615673
928172261284
1010150681531
114339882301
121b73538bb7
13c59c97643
146c4187d6b
153e6224521
hex25d071bbb

10150681531 has 2 divisors, whose sum is σ = 10150681532. Its totient is φ = 10150681530.

The previous prime is 10150681511. The next prime is 10150681573. The reversal of 10150681531 is 13518605101.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 10150681531 - 215 = 10150648763 is a prime.

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

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

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

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

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

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

Almost surely, 210150681531 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 3600, while the sum is 31.

The spelling of 10150681531 in words is "ten billion, one hundred fifty million, six hundred eighty-one thousand, five hundred thirty-one".