Base | Representation |
---|---|
bin | 1100001011110… |
… | …0111011011100 |
3 | 10120011102120022 |
4 | 3002330323130 |
5 | 101040334000 |
6 | 5023211312 |
7 | 1160250425 |
oct | 302747334 |
9 | 116142508 |
10 | 51105500 |
11 | 26936356 |
12 | 15146b38 |
13 | a784654 |
14 | 6b0464c |
15 | 4747585 |
hex | 30bcedc |
51105500 has 48 divisors (see below), whose sum is σ = 114258144. Its totient is φ = 19958400.
The previous prime is 51105487. The next prime is 51105529. The reversal of 51105500 is 550115.
It is a super-2 number, since 2×511055002 = 5223544260500000, which contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 20312 + ... + 22688.
It is an arithmetic number, because the mean of its divisors is an integer number (2380378).
Almost surely, 251105500 is an apocalyptic number.
51105500 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 51105500, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (57129072).
51105500 is an abundant number, since it is smaller than the sum of its proper divisors (63152644).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51105500 is a wasteful number, since it uses less digits than its factorization.
51105500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2439 (or 2427 counting only the distinct ones).
The product of its (nonzero) digits is 125, while the sum is 17.
The square root of 51105500 is about 7148.8110899645. The cubic root of 51105500 is about 371.0985127921.
Adding to 51105500 its reverse (550115), we get a palindrome (51655615).
The spelling of 51105500 in words is "fifty-one million, one hundred five thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •