Search a number
-
+
15141201141 = 3112631744579
BaseRepresentation
bin11100001100111110…
…00110010011110101
31110002012211201020110
432012133012103311
5222002121414031
610542240253233
71044133041363
oct160637062365
943065751213
1015141201141
11646a8a4580
122b26911219
131573b87021
14a38c9c633
155d9406c46
hex3867c64f5

15141201141 has 16 divisors (see below), whose sum is σ = 22107317760. Its totient is φ = 9141588720.

The previous prime is 15141201121. The next prime is 15141201167. The reversal of 15141201141 is 14110214151.

It is not a de Polignac number, because 15141201141 - 26 = 15141201077 is a prime.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (15141201121) 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, 863611 + ... + 880968.

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

Almost surely, 215141201141 is an apocalyptic number.

15141201141 is a gapful number since it is divisible by the number (11) formed by its first and last digit.

It is an amenable number.

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

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

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

The sum of its prime factors is 1744856.

The product of its (nonzero) digits is 160, while the sum is 21.

Adding to 15141201141 its reverse (14110214151), we get a palindrome (29251415292).

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

Divisors: 1 3 11 33 263 789 2893 8679 1744579 5233737 19190369 57571107 458824277 1376472831 5047067047 15141201141