Search a number
-
+
14532269971 is a prime number
BaseRepresentation
bin11011000100011000…
…01101011110010011
31101111210000210201011
431202030031132103
5214230230114341
610402004551351
71023060154012
oct154214153623
941453023634
1014532269971
1161880a657a
1229969b2557
1314a798221b
149bc06ca79
155a0c22b81
hex36230d793

14532269971 has 2 divisors, whose sum is σ = 14532269972. Its totient is φ = 14532269970.

The previous prime is 14532269957. The next prime is 14532270007. The reversal of 14532269971 is 17996223541.

14532269971 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 14532269971 - 29 = 14532269459 is a prime.

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

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

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

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

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

Almost surely, 214532269971 is an apocalyptic number.

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

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

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

The product of its digits is 816480, while the sum is 49.

The spelling of 14532269971 in words is "fourteen billion, five hundred thirty-two million, two hundred sixty-nine thousand, nine hundred seventy-one".