Search a number
-
+
14315064141 = 372347290443
BaseRepresentation
bin11010101010011111…
…01000101101001101
31100221122022121022210
431111033220231031
5213304124023031
610324245301033
71014512015610
oct152517505515
940848277283
1014315064141
116086531624
122936104779
131471982571
1499b28c177
1558bb1a746
hex3553e8b4d

14315064141 has 16 divisors (see below), whose sum is σ = 21822800384. Its totient is φ = 8176523184.

The previous prime is 14315064131. The next prime is 14315064173. The reversal of 14315064141 is 14146051341.

It is not a de Polignac number, because 14315064141 - 25 = 14315064109 is a prime.

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

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (14315064121) 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 15 ways as a sum of consecutive naturals, for example, 95935 + ... + 194508.

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

Almost surely, 214315064141 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 292800.

The product of its (nonzero) digits is 5760, while the sum is 30.

The spelling of 14315064141 in words is "fourteen billion, three hundred fifteen million, sixty-four thousand, one hundred forty-one".

Divisors: 1 3 7 21 2347 7041 16429 49287 290443 871329 2033101 6099303 681669721 2045009163 4771688047 14315064141