Search a number
-
+
1201604567 is a prime number
BaseRepresentation
bin100011110011111…
…0000011111010111
310002202000211120212
41013213300133113
54430102321232
6315122320035
741530320212
oct10747603727
93082024525
101201604567
11567302329
122964b901b
13161c36927
14b582a779
1570755eb2
hex479f07d7

1201604567 has 2 divisors, whose sum is σ = 1201604568. Its totient is φ = 1201604566.

The previous prime is 1201604501. The next prime is 1201604581. The reversal of 1201604567 is 7654061021.

It is a strong prime.

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

It is a cyclic number.

It is not a de Polignac number, because 1201604567 - 28 = 1201604311 is a prime.

It is a congruent number.

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

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

Almost surely, 21201604567 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 10080, while the sum is 32.

The square root of 1201604567 is about 34664.1683442716. The cubic root of 1201604567 is about 1063.1319990293.

Adding to 1201604567 its reverse (7654061021), we get a palindrome (8855665588).

The spelling of 1201604567 in words is "one billion, two hundred one million, six hundred four thousand, five hundred sixty-seven".