Search a number
-
+
100565105650151 is a prime number
BaseRepresentation
bin10110110111011010100011…
…011001100010100111100111
3111012001221010010021221121012
4112313122203121202213213
5101140124314021301101
6553514545522012435
730116406032001002
oct2667324331424747
9435057103257535
10100565105650151
112a05247045a20a
12b3422364a711b
134416330720c5c
141ab953ca0c539
15b95de0ecabbb
hex5b76a36629e7

100565105650151 has 2 divisors, whose sum is σ = 100565105650152. Its totient is φ = 100565105650150.

The previous prime is 100565105650081. The next prime is 100565105650259. The reversal of 100565105650151 is 151056501565001.

It is a weak prime.

It is a cyclic number.

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

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

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

It is a congruent number.

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

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

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

Almost surely, 2100565105650151 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 112500, while the sum is 41.

The spelling of 100565105650151 in words is "one hundred trillion, five hundred sixty-five billion, one hundred five million, six hundred fifty thousand, one hundred fifty-one".