Search a number
-
+
106060106051 is a prime number
BaseRepresentation
bin110001011000110101…
…1001100100101000011
3101010202111210121220222
41202301223030211003
53214202341343201
6120420124053255
710443161012114
oct1426153144503
9333674717828
10106060106051
1140a8618a509
121867b39422b
13a003191803
1451c1c3820b
152b5b29691b
hex18b1acc943

106060106051 has 2 divisors, whose sum is σ = 106060106052. Its totient is φ = 106060106050.

The previous prime is 106060106029. The next prime is 106060106059. The reversal of 106060106051 is 150601060601.

It is a strong prime.

It is an emirp because it is prime and its reverse (150601060601) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 106060106051 - 230 = 104986364227 is a prime.

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

It is a self number, because there is not a number n which added to its sum of digits gives 106060106051.

It is not a weakly prime, because it can be changed into another prime (106060106059) 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, 53030053025 + 53030053026.

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

Almost surely, 2106060106051 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 1080, while the sum is 26.

Adding to 106060106051 its reverse (150601060601), we get a palindrome (256661166652).

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