Search a number
-
+
13501001495953 is a prime number
BaseRepresentation
bin1100010001110111001001…
…1001011111010110010001
31202210200110000012111200201
43010131302121133112101
53232200022340332303
644414135141215201
72562262255142236
oct304356231372621
952720400174621
1013501001495953
1143358194129a4
121620702101501
1376c1a644823a
1434964826578d
151862d319481d
hexc477265f591

13501001495953 has 2 divisors, whose sum is σ = 13501001495954. Its totient is φ = 13501001495952.

The previous prime is 13501001495941. The next prime is 13501001495963. The reversal of 13501001495953 is 35959410010531.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 6925408034689 + 6575593461264 = 2631617^2 + 2564292^2 .

It is a cyclic number.

It is not a de Polignac number, because 13501001495953 - 213 = 13501001487761 is a prime.

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

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

Almost surely, 213501001495953 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 364500, while the sum is 46.

The spelling of 13501001495953 in words is "thirteen trillion, five hundred one billion, one million, four hundred ninety-five thousand, nine hundred fifty-three".