Search a number
-
+
156424066650031 is a prime number
BaseRepresentation
bin100011100100010001010000…
…111011010100111110101111
3202111211222212011020012200011
4203210101100323110332233
5131000322442030300111
61312404120231114051
744643160123261165
oct4344212073247657
9674758764205604
10156424066650031
114592908a725424
1215664047512927
13693895959b15b
142a8ad727d7235
151313e37a6a021
hex8e4450ed4faf

156424066650031 has 2 divisors, whose sum is σ = 156424066650032. Its totient is φ = 156424066650030.

The previous prime is 156424066650013. The next prime is 156424066650037. The reversal of 156424066650031 is 130056660424651.

Together with previous prime (156424066650013) 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 not a de Polignac number, because 156424066650031 - 211 = 156424066647983 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 2156424066650031 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 3110400, while the sum is 49.

The spelling of 156424066650031 in words is "one hundred fifty-six trillion, four hundred twenty-four billion, sixty-six million, six hundred fifty thousand, thirty-one".