Search a number
-
+
1015141 = 1975153
BaseRepresentation
bin11110111110101100101
31220120111211
43313311211
5224441031
633431421
711425411
oct3676545
91816454
101015141
11633766
1240b571
1329709a
141c5d41
15150bb1
hexf7d65

1015141 has 4 divisors (see below), whose sum is σ = 1020492. Its totient is φ = 1009792.

The previous prime is 1015139. The next prime is 1015159. The reversal of 1015141 is 1415101.

It is a semiprime because it is the product of two primes.

It can be written as a sum of positive squares in 2 ways, for example, as 863041 + 152100 = 929^2 + 390^2 .

It is a cyclic number.

It is not a de Polignac number, because 1015141 - 21 = 1015139 is a prime.

It is a super-2 number, since 2×10151412 = 2061022499762, which contains 22 as substring.

It is a Duffinian number.

It is a congruent number.

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

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

21015141 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 5350.

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

The square root of 1015141 is about 1007.5420586755. The cubic root of 1015141 is about 100.5021739916.

It can be divided in two parts, 1015 and 141, that added together give a square (1156 = 342).

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

Divisors: 1 197 5153 1015141