Search a number
-
+
505200315 = 3550966169
BaseRepresentation
bin11110000111001…
…011111010111011
31022012121211112210
4132013023322323
52013312402230
6122044110203
715343063134
oct3607137273
91265554483
10505200315
1123a199524
12121235363
13808860c9
144b14ac8b
152e543eb0
hex1e1cbebb

505200315 has 16 divisors (see below), whose sum is σ = 809920800. Its totient is φ = 268906752.

The previous prime is 505200307. The next prime is 505200323. The reversal of 505200315 is 513002505.

It is an interprime number because it is at equal distance from previous prime (505200307) and next prime (505200323).

It is not a de Polignac number, because 505200315 - 23 = 505200307 is a prime.

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

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 15 ways as a sum of consecutive naturals, for example, 25450 + ... + 40719.

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

Almost surely, 2505200315 is an apocalyptic number.

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

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

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

The sum of its prime factors is 66686.

The product of its (nonzero) digits is 750, while the sum is 21.

The square root of 505200315 is about 22476.6615626076. The cubic root of 505200315 is about 796.4427028879.

It can be divided in two parts, 505200 and 315, that added together give a triangular number (505515 = T1005).

The spelling of 505200315 in words is "five hundred five million, two hundred thousand, three hundred fifteen".

Divisors: 1 3 5 15 509 1527 2545 7635 66169 198507 330845 992535 33680021 101040063 168400105 505200315