Search a number
-
+
10001101106119 is a prime number
BaseRepresentation
bin1001000110001001000000…
…0101000010101111000111
31022102002120221011020110111
42101202100011002233013
52302324223340343434
633134235321333451
72051361415525234
oct221422005025707
938362527136414
1010001101106119
113206496934382
121156344637287
1357713b3057c6
142680ad47878b
15125241946964
hex91890142bc7

10001101106119 has 2 divisors, whose sum is σ = 10001101106120. Its totient is φ = 10001101106118.

The previous prime is 10001101106083. The next prime is 10001101106147. The reversal of 10001101106119 is 91160110110001.

It is a strong prime.

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

It is a cyclic number.

It is not a de Polignac number, because 10001101106119 - 225 = 10001067551687 is a prime.

It is a super-2 number, since 2×100011011061192 (a number of 27 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 10001101106119.

It is a congruent number.

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

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

Almost surely, 210001101106119 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 54, while the sum is 22.

The spelling of 10001101106119 in words is "ten trillion, one billion, one hundred one million, one hundred six thousand, one hundred nineteen".