Search a number
-
+
13213030102001 is a prime number
BaseRepresentation
bin1100000001000110010111…
…1101110011001111110001
31201210011010210012222102022
43000101211331303033301
53212440241201231001
644033552055001225
72532416126525102
oct300214575631761
951704123188368
1013213030102001
114234684036434
121594935069215
1374aca2688802
1433972a86a3a9
1517da7ba0711b
hexc0465f733f1

13213030102001 has 2 divisors, whose sum is σ = 13213030102002. Its totient is φ = 13213030102000.

The previous prime is 13213030101871. The next prime is 13213030102003. The reversal of 13213030102001 is 10020103031231.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 11516656704400 + 1696373397601 = 3393620^2 + 1302449^2 .

It is a cyclic number.

It is not a de Polignac number, because 13213030102001 - 226 = 13212962993137 is a prime.

Together with 13213030102003, it forms a pair of twin primes.

It is a Chen prime.

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

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

Almost surely, 213213030102001 is an apocalyptic number.

It is an amenable number.

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

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

13213030102001 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 17.

Adding to 13213030102001 its reverse (10020103031231), we get a palindrome (23233133133232).

The spelling of 13213030102001 in words is "thirteen trillion, two hundred thirteen billion, thirty million, one hundred two thousand, one".