Search a number
-
+
13201500510229 is a prime number
BaseRepresentation
bin1100000000011011011010…
…1111111001100000010101
31201202001101021021000211211
43000012312233321200111
53212243133112311404
644024404031501421
72531530326566653
oct300066657714025
951661337230754
1013201500510229
11422a7a796a499
121592657987871
13749b85b17b65
14338d554dddd3
1517d604706b04
hexc01b6bf9815

13201500510229 has 2 divisors, whose sum is σ = 13201500510230. Its totient is φ = 13201500510228.

The previous prime is 13201500510221. The next prime is 13201500510257. The reversal of 13201500510229 is 92201500510231.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 12363310822500 + 838189687729 = 3516150^2 + 915527^2 .

It is a cyclic number.

It is not a de Polignac number, because 13201500510229 - 23 = 13201500510221 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 13201500510229.

It is a congruent number.

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

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

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

Almost surely, 213201500510229 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 5400, while the sum is 31.

The spelling of 13201500510229 in words is "thirteen trillion, two hundred one billion, five hundred million, five hundred ten thousand, two hundred twenty-nine".