Search a number
-
+
101536031 is a prime number
BaseRepresentation
bin1100000110101…
…01000100011111
321002001120020202
412003111010133
5201443123111
614024134115
72342020262
oct603250437
9232046222
10101536031
1152350583
122a00733b
13180609bc
14d6b0cd9
158da9b3b
hex60d511f

101536031 has 2 divisors, whose sum is σ = 101536032. Its totient is φ = 101536030.

The previous prime is 101536013. The next prime is 101536033. The reversal of 101536031 is 130635101.

It is a happy number.

Together with previous prime (101536013) it forms an Ormiston pair, because they use the same digits, order apart.

It is a strong prime.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-101536031 is a prime.

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

Together with 101536033, 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 = 101535994 and 101536012.

It is a congruent number.

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

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

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

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

Almost surely, 2101536031 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 270, while the sum is 20.

The square root of 101536031 is about 10076.5088696433. The cubic root of 101536031 is about 466.5233594548.

The spelling of 101536031 in words is "one hundred one million, five hundred thirty-six thousand, thirty-one".