Base | Representation |
---|---|
bin | 1100001010011… |
… | …1010011110110 |
3 | 10112222221002200 |
4 | 3002213103312 |
5 | 101030020300 |
6 | 5021245330 |
7 | 1156431315 |
oct | 302472366 |
9 | 115887080 |
10 | 51016950 |
11 | 26885876 |
12 | 15103846 |
13 | a75325a |
14 | 6ac027c |
15 | 472b200 |
hex | 30a74f6 |
51016950 has 36 divisors (see below), whose sum is σ = 137066748. Its totient is φ = 13604400.
The previous prime is 51016943. The next prime is 51016951. The reversal of 51016950 is 5961015.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51016951) by changing a digit.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 56236 + ... + 57135.
Almost surely, 251016950 is an apocalyptic number.
51016950 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
51016950 is an abundant number, since it is smaller than the sum of its proper divisors (86049798).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51016950 is a wasteful number, since it uses less digits than its factorization.
51016950 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 113389 (or 113381 counting only the distinct ones).
The product of its (nonzero) digits is 1350, while the sum is 27.
The square root of 51016950 is about 7142.6150673265. The cubic root of 51016950 is about 370.8840559607.
Adding to 51016950 its reverse (5961015), we get a palindrome (56977965).
The spelling of 51016950 in words is "fifty-one million, sixteen thousand, nine hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •