Search a number
-
+
200940715 = 564362501
BaseRepresentation
bin10111111101000…
…01110010101011
3112000002211211201
423332201302223
5402420100330
631534505031
74656652663
oct1376416253
9460084751
10200940715
11a3475808
1257365177
1332826541
141c9891a3
1512992eca
hexbfa1cab

200940715 has 8 divisors (see below), whose sum is σ = 241507728. Its totient is φ = 160500000.

The previous prime is 200940709. The next prime is 200940793. The reversal of 200940715 is 517049002.

It is a happy number.

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

It is not a de Polignac number, because 200940715 - 211 = 200938667 is a prime.

It is a super-2 number, since 2×2009407152 = 80754341889422450, which contains 22 as substring.

It is a Duffinian number.

It is an unprimeable number.

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

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

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

Almost surely, 2200940715 is an apocalyptic number.

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

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

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

The sum of its prime factors is 63149.

The product of its (nonzero) digits is 2520, while the sum is 28.

The square root of 200940715 is about 14175.3559038213. The cubic root of 200940715 is about 585.7190029506.

Adding to 200940715 its reverse (517049002), we get a palindrome (717989717).

It can be divided in two parts, 2009 and 40715, that added together give a palindrome (42724).

The spelling of 200940715 in words is "two hundred million, nine hundred forty thousand, seven hundred fifteen".

Divisors: 1 5 643 3215 62501 312505 40188143 200940715