Search a number
-
+
3060100620001 is a prime number
BaseRepresentation
bin101100100001111100001…
…101011101111011100001
3101211112122200012002220001
4230201330031131323201
5400114041224320001
610301442452220001
7434041101045415
oct54417415357341
911745580162801
103060100620001
11a7a866029067
1241509960a601
13192749089b49
14a8176c9cd45
1554900c20001
hex2c87c35dee1

3060100620001 has 2 divisors, whose sum is σ = 3060100620002. Its totient is φ = 3060100620000.

The previous prime is 3060100619959. The next prime is 3060100620007. The reversal of 3060100620001 is 1000260010603.

3060100620001 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 3027547800225 + 32552819776 = 1739985^2 + 180424^2 .

It is a cyclic number.

It is not a de Polignac number, because 3060100620001 - 215 = 3060100587233 is a prime.

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

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

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

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

Almost surely, 23060100620001 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 216, while the sum is 19.

Adding to 3060100620001 its reverse (1000260010603), we get a palindrome (4060360630604).

The spelling of 3060100620001 in words is "three trillion, sixty billion, one hundred million, six hundred twenty thousand, one".