Search a number
-
+
14540330531 is a prime number
BaseRepresentation
bin11011000101010101…
…11101011000100011
31101112100012022201102
431202222331120203
5214234311034111
610402453425015
71023215525126
oct154252753043
941470168642
1014540330531
1161917015a1
12299963b16b
1314a954509c
149bd16a3bd
155a17b613b
hex362abd623

14540330531 has 2 divisors, whose sum is σ = 14540330532. Its totient is φ = 14540330530.

The previous prime is 14540330513. The next prime is 14540330533. The reversal of 14540330531 is 13503304541.

Together with previous prime (14540330513) it forms an Ormiston pair, because they use the same digits, order apart.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 14540330531 - 222 = 14536136227 is a prime.

It is a super-3 number, since 3×145403305313 (a number of 31 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.

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

It is a Chen prime.

It is a junction number, because it is equal to n+sod(n) for n = 14540330494 and 14540330503.

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

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

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

Almost surely, 214540330531 is an apocalyptic number.

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

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

14540330531 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 10800, while the sum is 29.

The spelling of 14540330531 in words is "fourteen billion, five hundred forty million, three hundred thirty thousand, five hundred thirty-one".