Search a number
-
+
15100141 = 72157163
BaseRepresentation
bin111001100110…
…100011101101
31001102011111111
4321212203231
512331201031
61255352021
7242230510
oct71464355
931364444
1015100141
118583a61
125082611
1331890c4
142010d77
1514d41b1
hexe668ed

15100141 has 4 divisors (see below), whose sum is σ = 17257312. Its totient is φ = 12942972.

The previous prime is 15100133. The next prime is 15100147. The reversal of 15100141 is 14100151.

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, and also an emirpimes, since its reverse is a distinct semiprime: 14100151 = 131084627.

It is not a de Polignac number, because 15100141 - 23 = 15100133 is a prime.

It is a Duffinian number.

It is a congruent number.

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

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

Almost surely, 215100141 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 2157170.

The product of its (nonzero) digits is 20, while the sum is 13.

The square root of 15100141 is about 3885.8899881494. The cubic root of 15100141 is about 247.1688104975.

Adding to 15100141 its reverse (14100151), we get a palindrome (29200292).

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

Divisors: 1 7 2157163 15100141