Search a number
-
+
105012112201 is a prime number
BaseRepresentation
bin110000111001100110…
…1011010101101001001
3101001001110211000121221
41201303031122231021
53210031100042301
6120124130002041
710405204140343
oct1416315325511
9331043730557
10105012112201
1140598666197
1218428416321
139b9701c3c9
145122996293
152ae9284da1
hex187335ab49

105012112201 has 2 divisors, whose sum is σ = 105012112202. Its totient is φ = 105012112200.

The previous prime is 105012112133. The next prime is 105012112213. The reversal of 105012112201 is 102211210501.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 78245516176 + 26766596025 = 279724^2 + 163605^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 105012112201 - 29 = 105012111689 is a prime.

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

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

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

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

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

Almost surely, 2105012112201 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 40, while the sum is 16.

Adding to 105012112201 its reverse (102211210501), we get a palindrome (207223322702).

The spelling of 105012112201 in words is "one hundred five billion, twelve million, one hundred twelve thousand, two hundred one".