Search a number
-
+
51210115 = 5114632011
BaseRepresentation
bin1100001101011…
…0011110000011
310120100202001221
43003112132003
5101102210430
65025335511
71161164425
oct303263603
9116322057
1051210115
11269a7a10
1215197597
13a7c0158
146b30815
15476857a
hex30d6783

51210115 has 16 divisors (see below), whose sum is σ = 67216896. Its totient is φ = 37144800.

The previous prime is 51210113. The next prime is 51210151. The reversal of 51210115 is 51101215.

51210115 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 51210115 - 21 = 51210113 is a prime.

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (51210113) 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 15 ways as a sum of consecutive naturals, for example, 24460 + ... + 26470.

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

Almost surely, 251210115 is an apocalyptic number.

51210115 is a gapful number since it is divisible by the number (55) formed by its first and last digit.

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

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

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

The sum of its prime factors is 2490.

The product of its (nonzero) digits is 50, while the sum is 16.

The square root of 51210115 is about 7156.1243002061. The cubic root of 51210115 is about 371.3515580326.

Subtracting from 51210115 its reverse (51101215), we obtain a square (108900 = 3302).

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

Divisors: 1 5 11 55 463 2011 2315 5093 10055 22121 25465 110605 931093 4655465 10242023 51210115