Search a number
-
+
14243550141 = 34747850047
BaseRepresentation
bin11010100001111101…
…10101001110111101
31100202122202022120010
431100332311032331
5213132322101031
610313212413433
71012653115152
oct152076651675
940678668503
1014243550141
11604a127047
122916177279
13145cc038a2
14991994229
155856e1246
hex350fb53bd

14243550141 has 4 divisors (see below), whose sum is σ = 18991400192. Its totient is φ = 9495700092.

The previous prime is 14243550053. The next prime is 14243550163. The reversal of 14243550141 is 14105534241.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is not a de Polignac number, because 14243550141 - 211 = 14243548093 is a prime.

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

It is a Duffinian number.

It is a Curzon number.

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (14243554141) by changing a digit.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2373925021 + ... + 2373925026.

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

Almost surely, 214243550141 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 4747850050.

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

The spelling of 14243550141 in words is "fourteen billion, two hundred forty-three million, five hundred fifty thousand, one hundred forty-one".

Divisors: 1 3 4747850047 14243550141