[go: up one dir, main page]

Search a number
-
+
1152015 = 3576801
BaseRepresentation
bin100011001010000001111
32011112021020
410121100033
5243331030
640405223
712535434
oct4312017
92145236
101152015
11717587
12476813
13314487
1421db8b
1517b510
hex11940f

1152015 has 8 divisors (see below), whose sum is σ = 1843248. Its totient is φ = 614400.

The previous prime is 1151999. The next prime is 1152023. The reversal of 1152015 is 5102511.

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

It is not a de Polignac number, because 1152015 - 24 = 1151999 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (15), and also a Moran number because the ratio is a prime number: 76801 = 1152015 / (1 + 1 + 5 + 2 + 0 + 1 + 5).

It is a junction number, because it is equal to n+sod(n) for n = 1151985 and 1152003.

It is a congruent number.

It is an unprimeable number.

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

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

21152015 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 76809.

The product of its (nonzero) digits is 50, while the sum is 15.

The square root of 1152015 is about 1073.3196168896. The cubic root of 1152015 is about 104.8301107562.

Adding to 1152015 its reverse (5102511), we get a palindrome (6254526).

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

Divisors: 1 3 5 15 76801 230403 384005 1152015