Search a number
-
+
3200715230 = 25320071523
BaseRepresentation
bin1011111011000111…
…0000100111011110
322021001201011212112
42332301300213132
523023340341410
61245334234022
7142213426166
oct27661604736
98231634775
103200715230
1113a27a17a9
12753ab5912
133c015c24b
142251335a6
1513aee0105
hexbec709de

3200715230 has 8 divisors (see below), whose sum is σ = 5761287432. Its totient is φ = 1280286088.

The previous prime is 3200715157. The next prime is 3200715247. The reversal of 3200715230 is 325170023.

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

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

It is a congruent number.

It is an unprimeable number.

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

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

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

Almost surely, 23200715230 is an apocalyptic number.

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

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

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

The sum of its prime factors is 320071530.

The product of its (nonzero) digits is 1260, while the sum is 23.

The square root of 3200715230 is about 56574.8639415067. The cubic root of 3200715230 is about 1473.7223800213.

Adding to 3200715230 its reverse (325170023), we get a palindrome (3525885253).

The spelling of 3200715230 in words is "three billion, two hundred million, seven hundred fifteen thousand, two hundred thirty".

Divisors: 1 2 5 10 320071523 640143046 1600357615 3200715230