Search a number
-
+
3051051201013 is a prime number
BaseRepresentation
bin101100011001100000110…
…100101011000111110101
3101210200022000002222202211
4230121200310223013311
5344442023101413023
610253344503533421
7433300615206604
oct54314064530765
911720260088684
103051051201013
11a76a419536a2
12413392a5a271
131919362c5a5a
14a79590a1a3b
1554571530a0d
hex2c660d2b1f5

3051051201013 has 2 divisors, whose sum is σ = 3051051201014. Its totient is φ = 3051051201012.

The previous prime is 3051051201001. The next prime is 3051051201019. The reversal of 3051051201013 is 3101021501503.

3051051201013 is digitally balanced in base 2, 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., 2959580037649 + 91471163364 = 1720343^2 + 302442^2 .

It is a cyclic number.

It is not a de Polignac number, because 3051051201013 - 29 = 3051051200501 is a prime.

It is a congruent number.

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

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

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

Almost surely, 23051051201013 is an apocalyptic number.

It is an amenable number.

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

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

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

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

Adding to 3051051201013 its reverse (3101021501503), we get a palindrome (6152072702516).

The spelling of 3051051201013 in words is "three trillion, fifty-one billion, fifty-one million, two hundred one thousand, thirteen".