Search a number
-
+
30960052 = 2229266897
BaseRepresentation
bin111011000011…
…0100110110100
32011020221012121
41312012212310
530411210202
63023325324
7524104354
oct166064664
964227177
1030960052
1116526822
12a450844
13654cc76
14417cb64
152ab8537
hex1d869b4

30960052 has 12 divisors (see below), whose sum is σ = 56048580. Its totient is φ = 14946176.

The previous prime is 30960037. The next prime is 30960053. The reversal of 30960052 is 25006903.

It can be written as a sum of positive squares in 2 ways, for example, as 23097636 + 7862416 = 4806^2 + 2804^2 .

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

It is a congruent number.

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

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 133333 + ... + 133564.

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

Almost surely, 230960052 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 266930 (or 266928 counting only the distinct ones).

The product of its (nonzero) digits is 1620, while the sum is 25.

The square root of 30960052 is about 5564.1757700490. The cubic root of 30960052 is about 314.0030697362.

Adding to 30960052 its reverse (25006903), we get a palindrome (55966955).

The spelling of 30960052 in words is "thirty million, nine hundred sixty thousand, fifty-two".

Divisors: 1 2 4 29 58 116 266897 533794 1067588 7740013 15480026 30960052