Base | Representation |
---|---|
bin | 1100001010011… |
… | …0101101100100 |
3 | 10112222210201221 |
4 | 3002212231210 |
5 | 101024431000 |
6 | 5021230124 |
7 | 1156421215 |
oct | 302465544 |
9 | 115883657 |
10 | 51014500 |
11 | 26883a49 |
12 | 15102344 |
13 | a7520c4 |
14 | 6abd40c |
15 | 472a61a |
hex | 30a6b64 |
51014500 has 48 divisors (see below), whose sum is σ = 112130928. Its totient is φ = 20275200.
The previous prime is 51014479. The next prime is 51014543. The reversal of 51014500 is 541015.
It is a happy number.
It can be written as a sum of positive squares in 8 ways, for example, as 1790244 + 49224256 = 1338^2 + 7016^2 .
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, 128302 + ... + 128698.
It is an arithmetic number, because the mean of its divisors is an integer number (2336061).
Almost surely, 251014500 is an apocalyptic number.
51014500 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 51014500, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (56065464).
51014500 is an abundant number, since it is smaller than the sum of its proper divisors (61116428).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51014500 is a wasteful number, since it uses less digits than its factorization.
51014500 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 673 (or 661 counting only the distinct ones).
The product of its (nonzero) digits is 100, while the sum is 16.
The square root of 51014500 is about 7142.4435594550. The cubic root of 51014500 is about 370.8781188458.
Adding to 51014500 its reverse (541015), we get a palindrome (51555515).
The spelling of 51014500 in words is "fifty-one million, fourteen thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •