Search a number
-
+
2301002410061 is a prime number
BaseRepresentation
bin100001011110111110011…
…011100110100001001101
322010222021210222120210202
4201132332123212201031
5300144423104110221
64521022123143245
7325145661526625
oct41367633464115
98128253876722
102301002410061
11807938967653
12311b49074b25
13138ca2c65114
147d524ba9885
153ecc3696d0b
hex217be6e684d

2301002410061 has 2 divisors, whose sum is σ = 2301002410062. Its totient is φ = 2301002410060.

The previous prime is 2301002410009. The next prime is 2301002410087. The reversal of 2301002410061 is 1600142001032.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 2194860028036 + 106142382025 = 1481506^2 + 325795^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-2301002410061 is a prime.

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

It is a congruent number.

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

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

Almost surely, 22301002410061 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 288, while the sum is 20.

Adding to 2301002410061 its reverse (1600142001032), we get a palindrome (3901144411093).

The spelling of 2301002410061 in words is "two trillion, three hundred one billion, two million, four hundred ten thousand, sixty-one".