Base | Representation |
---|---|
bin | 1100001100001… |
… | …0001001101110 |
3 | 10120012111220200 |
4 | 3003002021232 |
5 | 101042030034 |
6 | 5023454330 |
7 | 1160400000 |
oct | 303021156 |
9 | 116174820 |
10 | 51126894 |
11 | 26950435 |
12 | 151573a6 |
13 | a791300 |
14 | 6b0c370 |
15 | 474da99 |
hex | 30c226e |
51126894 has 108 divisors (see below), whose sum is σ = 139942296. Its totient is φ = 13484016.
The previous prime is 51126869. The next prime is 51126899. The reversal of 51126894 is 49862115.
It is a super-2 number, since 2×511268942 = 5227918580174472, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51126899) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 53 ways as a sum of consecutive naturals, for example, 3932832 + ... + 3932844.
It is an arithmetic number, because the mean of its divisors is an integer number (1295762).
Almost surely, 251126894 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 51126894, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (69971148).
51126894 is an abundant number, since it is smaller than the sum of its proper divisors (88815402).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51126894 is an equidigital number, since it uses as much as digits as its factorization.
51126894 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 69 (or 25 counting only the distinct ones).
The product of its digits is 17280, while the sum is 36.
The square root of 51126894 is about 7150.3072661250. The cubic root of 51126894 is about 371.1502891761.
The spelling of 51126894 in words is "fifty-one million, one hundred twenty-six thousand, eight hundred ninety-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •