Search a number
-
+
15065141 = 713165551
BaseRepresentation
bin111001011110…
…000000110101
31001100101111012
4321132000311
512324041031
61254522005
7242023460
oct71360065
931311435
1015065141
11855a733
125066305
1331761b0
1420022d7
1514c8b2b
hexe5e035

15065141 has 8 divisors (see below), whose sum is σ = 18541824. Its totient is φ = 11919600.

The previous prime is 15065137. The next prime is 15065143. The reversal of 15065141 is 14156051.

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

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

It is not a de Polignac number, because 15065141 - 22 = 15065137 is a prime.

It is a Curzon number.

It is a congruent number.

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

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

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

Almost surely, 215065141 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 165571.

The product of its (nonzero) digits is 600, while the sum is 23.

The square root of 15065141 is about 3881.3839026821. The cubic root of 15065141 is about 246.9776952655.

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

Divisors: 1 7 13 91 165551 1158857 2152163 15065141