Search a number
-
+
2015801905213 is a prime number
BaseRepresentation
bin11101010101010111001…
…010000001000000111101
321010201010200220210210201
4131111113022001000331
5231011330241431323
64142014022403501
7265431310324405
oct35252712010075
97121120823721
102015801905213
11707995695088
12286813b90591
1311812127c545
146d7cb3b7805
15376803e38ad
hex1d55728103d

2015801905213 has 2 divisors, whose sum is σ = 2015801905214. Its totient is φ = 2015801905212.

The previous prime is 2015801905189. The next prime is 2015801905321. The reversal of 2015801905213 is 3125091085102.

Together with next prime (2015801905321) it forms an Ormiston pair, because they use the same digits, order apart.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 2002261790169 + 13540115044 = 1415013^2 + 116362^2 .

It is a cyclic number.

It is not a de Polignac number, because 2015801905213 - 225 = 2015768350781 is a prime.

It is a congruent number.

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

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

Almost surely, 22015801905213 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 21600, while the sum is 37.

The spelling of 2015801905213 in words is "two trillion, fifteen billion, eight hundred one million, nine hundred five thousand, two hundred thirteen".