Search a number
-
+
3052115 = 511211263
BaseRepresentation
bin1011101001001001010011
312202001201022
423221021103
51240131430
6145230055
734641203
oct13511123
95661638
103052115
1117a5110
12103232b
1382b2b1
14596403
154044e5
hex2e9253

3052115 has 16 divisors (see below), whose sum is σ = 4029696. Its totient is φ = 2200800.

The previous prime is 3052099. The next prime is 3052117. The reversal of 3052115 is 5112503.

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

It is not a de Polignac number, because 3052115 - 24 = 3052099 is a prime.

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

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

It is a pernicious number, because its binary representation contains a prime number (11) of ones.

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 11474 + ... + 11736.

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

Almost surely, 23052115 is an apocalyptic number.

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

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

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

The sum of its prime factors is 490.

The product of its (nonzero) digits is 150, while the sum is 17.

The square root of 3052115 is about 1747.0303374584. The cubic root of 3052115 is about 145.0553098547.

Adding to 3052115 its reverse (5112503), we get a palindrome (8164618).

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

Divisors: 1 5 11 55 211 263 1055 1315 2321 2893 11605 14465 55493 277465 610423 3052115