Base | Representation |
---|---|
bin | 1100010000011… |
… | …0100000100000 |
3 | 10120201201222112 |
4 | 3010012200200 |
5 | 101130010010 |
6 | 5033454452 |
7 | 1162644200 |
oct | 304064040 |
9 | 116651875 |
10 | 51406880 |
11 | 27021828 |
12 | 15271428 |
13 | a85b895 |
14 | 6b82400 |
15 | 47a6a05 |
hex | 3106820 |
51406880 has 144 divisors (see below), whose sum is σ = 144789120. Its totient is φ = 17192448.
The previous prime is 51406871. The next prime is 51406891. The reversal of 51406880 is 8860415.
It is a super-2 number, since 2×514068802 = 5285334622668800, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (32).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 619319 + ... + 619401.
It is an arithmetic number, because the mean of its divisors is an integer number (1005480).
Almost surely, 251406880 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 51406880, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (72394560).
51406880 is an abundant number, since it is smaller than the sum of its proper divisors (93382240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51406880 is a wasteful number, since it uses less digits than its factorization.
51406880 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 191 (or 176 counting only the distinct ones).
The product of its (nonzero) digits is 7680, while the sum is 32.
The square root of 51406880 is about 7169.8591339021. The cubic root of 51406880 is about 371.8265657797.
The spelling of 51406880 in words is "fifty-one million, four hundred six thousand, eight hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •