Search a number
-
+
141015141 = 3343911897
BaseRepresentation
bin10000110011110…
…11100001100101
3100211100022102000
420121323201211
5242044441031
621554235513
73331415601
oct1031734145
9324308360
10141015141
1172665843
123b285b99
13232a4417
1414a2a501
15c5a73e6
hex867b865

141015141 has 16 divisors (see below), whose sum is σ = 209404800. Its totient is φ = 93788064.

The previous prime is 141015107. The next prime is 141015143. The reversal of 141015141 is 141510141.

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

It is not a de Polignac number, because 141015141 - 27 = 141015013 is a prime.

It is a congruent number.

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5905 + ... + 17801.

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

Almost surely, 2141015141 is an apocalyptic number.

It is an amenable number.

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

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

141015141 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 12345 (or 12339 counting only the distinct ones).

The product of its (nonzero) digits is 80, while the sum is 18.

The square root of 141015141 is about 11874.9796210351. The cubic root of 141015141 is about 520.5014160033.

Adding to 141015141 its reverse (141510141), we get a palindrome (282525282).

The spelling of 141015141 in words is "one hundred forty-one million, fifteen thousand, one hundred forty-one".

Divisors: 1 3 9 27 439 1317 3951 11853 11897 35691 107073 321219 5222783 15668349 47005047 141015141