Search a number
-
+
1015152141 = 3338384047
BaseRepresentation
bin111100100000011…
…111111000001101
32121202012001221110
4330200133320031
54034334332031
6244422122233
734104436143
oct7440377015
92552161843
101015152141
11481032913
12243b80379
13132413b53
1498b73593
155e1c5c46
hex3c81fe0d

1015152141 has 4 divisors (see below), whose sum is σ = 1353536192. Its totient is φ = 676768092.

The previous prime is 1015152137. The next prime is 1015152157. The reversal of 1015152141 is 1412515101.

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.

It is not a de Polignac number, because 1015152141 - 22 = 1015152137 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 (1015150141) 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, 169192021 + ... + 169192026.

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

Almost surely, 21015152141 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 338384050.

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

The square root of 1015152141 is about 31861.4522738685. The cubic root of 1015152141 is about 1005.0254165499.

Adding to 1015152141 its reverse (1412515101), we get a palindrome (2427667242).

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

Divisors: 1 3 338384047 1015152141