Search a number
-
+
14045271131 is a prime number
BaseRepresentation
bin11010001010010100…
…11101010001011011
31100020211122200220002
431011022131101123
5212231042134011
610241410523215
71005024556223
oct150512352133
940224580802
1014045271131
115a5820a0a1
12287b89650b
13142aacca28
149734dd083
155730c6c3b
hex34529d45b

14045271131 has 2 divisors, whose sum is σ = 14045271132. Its totient is φ = 14045271130.

The previous prime is 14045271101. The next prime is 14045271161. The reversal of 14045271131 is 13117254041.

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

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

It is a cyclic number.

It is not a de Polignac number, because 14045271131 - 214 = 14045254747 is a prime.

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

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

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

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

Almost surely, 214045271131 is an apocalyptic number.

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

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

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

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

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