Search a number
-
+
14332640569 = 131102510813
BaseRepresentation
bin11010101100100101…
…01011110100111001
31100222212101120122121
431112102223310321
5213323123444234
610330114121241
71015114302052
oct152622536471
940885346577
1014332640569
116095446aa5
12293bb80221
1314754c7810
1499d745729
1558d43d4b4
hex3564abd39

14332640569 has 4 divisors (see below), whose sum is σ = 15435151396. Its totient is φ = 13230129744.

The previous prime is 14332640513. The next prime is 14332640587. The reversal of 14332640569 is 96504623341.

It is a semiprime because it is the product of two primes.

It can be written as a sum of positive squares in 2 ways, for example, as 775065600 + 13557574969 = 27840^2 + 116437^2 .

It is not a de Polignac number, because 14332640569 - 217 = 14332509497 is a prime.

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

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (14332640269) 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 in 3 ways as a sum of consecutive naturals, for example, 551255394 + ... + 551255419.

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

Almost surely, 214332640569 is an apocalyptic number.

It is an amenable number.

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

14332640569 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 1102510826.

The product of its (nonzero) digits is 466560, while the sum is 43.

The spelling of 14332640569 in words is "fourteen billion, three hundred thirty-two million, six hundred forty thousand, five hundred sixty-nine".

Divisors: 1 13 1102510813 14332640569