Search a number
-
+
13920129451 is a prime number
BaseRepresentation
bin11001111011011010…
…00101000110101011
31022221010011211210001
430331231011012223
5212002023120301
610221140403431
71001645101534
oct147555050653
938833154701
1013920129451
1159a3606318
1228459a6577
13140abc56b7
14960a4568b
15567107c01
hex33db451ab

13920129451 has 2 divisors, whose sum is σ = 13920129452. Its totient is φ = 13920129450.

The previous prime is 13920129409. The next prime is 13920129493. The reversal of 13920129451 is 15492102931.

It is a balanced prime because it is at equal distance from previous prime (13920129409) and next prime (13920129493).

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

It is a cyclic number.

It is not a de Polignac number, because 13920129451 - 219 = 13919605163 is a prime.

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

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

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

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

Almost surely, 213920129451 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 19440, while the sum is 37.

The spelling of 13920129451 in words is "thirteen billion, nine hundred twenty million, one hundred twenty-nine thousand, four hundred fifty-one".