Search a number
-
+
13050141 = 313334619
BaseRepresentation
bin110001110010…
…000100011101
3220120000102120
4301302010131
511320101031
61143413153
7215632026
oct61620435
926500376
1013050141
117403845
1244541b9
13291bca0
141a39c4d
15122ba96
hexc7211d

13050141 has 8 divisors (see below), whose sum is σ = 18738720. Its totient is φ = 8030832.

The previous prime is 13050133. The next prime is 13050179. The reversal of 13050141 is 14105031.

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 13050141 - 23 = 13050133 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 13050141.

It is a congruent number.

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

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 167271 + ... + 167348.

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

Almost surely, 213050141 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 334635.

The product of its (nonzero) digits is 60, while the sum is 15.

The square root of 13050141 is about 3612.4978892727. The cubic root of 13050141 is about 235.4353842045.

Adding to 13050141 its reverse (14105031), we get a palindrome (27155172).

The spelling of 13050141 in words is "thirteen million, fifty thousand, one hundred forty-one".

Divisors: 1 3 13 39 334619 1003857 4350047 13050141