Search a number
-
+
106000051050011 is a prime number
BaseRepresentation
bin11000000110100000001111…
…011000111001011000011011
3111220022111122210220200122002
4120012200033120321120123
5102343201101032100021
61013235430131551215
731220152036443326
oct3006401730713033
9456274583820562
10106000051050011
1130858407447218
12ba7b62a75b50b
13471b9b9c3b041
141c266036cd7bd
15c3c487e8d50b
hex60680f63961b

106000051050011 has 2 divisors, whose sum is σ = 106000051050012. Its totient is φ = 106000051050010.

The previous prime is 106000051050001. The next prime is 106000051050017. The reversal of 106000051050011 is 110050150000601.

It is a strong prime.

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

It is a cyclic number.

It is not a de Polignac number, because 106000051050011 - 230 = 105998977308187 is a prime.

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

It is a Sophie Germain prime.

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

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

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

Almost surely, 2106000051050011 is an apocalyptic number.

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

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

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

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

The spelling of 106000051050011 in words is "one hundred six trillion, fifty-one million, fifty thousand, eleven".