Search a number
-
+
14325321013 is a prime number
BaseRepresentation
bin11010101011101101…
…10000110100110101
31100222100121201002221
431111312300310311
5213314240233023
610325253202341
71014665135203
oct152566606465
940870551087
1014325321013
1160912a7783
1229396303b1
131473b34013
1499c79c073
1558c99485d
hex355db0d35

14325321013 has 2 divisors, whose sum is σ = 14325321014. Its totient is φ = 14325321012.

The previous prime is 14325321011. The next prime is 14325321029. The reversal of 14325321013 is 31012352341.

It is a happy number.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 14321626929 + 3694084 = 119673^2 + 1922^2 .

It is an emirp because it is prime and its reverse (31012352341) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 14325321013 - 21 = 14325321011 is a prime.

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

It is a congruent number.

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

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

Almost surely, 214325321013 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 2160, while the sum is 25.

Adding to 14325321013 its reverse (31012352341), we get a palindrome (45337673354).

The spelling of 14325321013 in words is "fourteen billion, three hundred twenty-five million, three hundred twenty-one thousand, thirteen".