Search a number
-
+
310003021213 is a prime number
BaseRepresentation
bin1001000001011011001…
…11101011010110011101
31002122011122101011012021
410200231213223112131
520034341233134323
6354225144340141
731253110126444
oct4405547532635
91078148334167
10310003021213
1110a520695186
12500b7474651
1323305336282
141100b84dd5b
1580e596705d
hex482d9eb59d

310003021213 has 2 divisors, whose sum is σ = 310003021214. Its totient is φ = 310003021212.

The previous prime is 310003021193. The next prime is 310003021231. The reversal of 310003021213 is 312120300013.

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

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 247951214809 + 62051806404 = 497947^2 + 249102^2 .

It is a cyclic number.

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

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

It is a congruent number.

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

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

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

Almost surely, 2310003021213 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 108, while the sum is 16.

Adding to 310003021213 its reverse (312120300013), we get a palindrome (622123321226).

The spelling of 310003021213 in words is "three hundred ten billion, three million, twenty-one thousand, two hundred thirteen".