Search a number
-
+
1201010201 is a prime number
BaseRepresentation
bin100011110010101…
…1111011000011001
310002200220122021022
41013211133120121
54424424311301
6315101452225
741522263316
oct10745373031
93080818238
101201010201
11566a36816
12296271075
13161a89231
14b5713d0d
1570689d1b
hex4795f619

1201010201 has 2 divisors, whose sum is σ = 1201010202. Its totient is φ = 1201010200.

The previous prime is 1201010149. The next prime is 1201010207. The reversal of 1201010201 is 1020101021.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 882030601 + 318979600 = 29699^2 + 17860^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 1201010201 - 26 = 1201010137 is a prime.

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

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

Almost surely, 21201010201 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 4, while the sum is 8.

The square root of 1201010201 is about 34655.5940794556. The cubic root of 1201010201 is about 1062.9566796421.

Adding to 1201010201 its reverse (1020101021), we get a palindrome (2221111222).

It can be divided in two parts, 120101020 and 1, that added together give a palindrome (120101021).

The spelling of 1201010201 in words is "one billion, two hundred one million, ten thousand, two hundred one".