Base | Representation |
---|---|
bin | 1100010000100… |
… | …0111010100000 |
3 | 10120202020111120 |
4 | 3010020322200 |
5 | 101130313421 |
6 | 5034012240 |
7 | 1163015010 |
oct | 304107240 |
9 | 116666446 |
10 | 51416736 |
11 | 27029178 |
12 | 15277080 |
13 | a863207 |
14 | 6b85c40 |
15 | 47a98c6 |
hex | 3108ea0 |
51416736 has 96 divisors (see below), whose sum is σ = 162408960. Its totient is φ = 13913856.
The previous prime is 51416723. The next prime is 51416741. The reversal of 51416736 is 63761415.
It is a tau number, because it is divible by the number of its divisors (96).
It is a junction number, because it is equal to n+sod(n) for n = 51416697 and 51416706.
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, 10755 + ... + 14781.
It is an arithmetic number, because the mean of its divisors is an integer number (1691760).
Almost surely, 251416736 is an apocalyptic number.
51416736 is a gapful number since it is divisible by the number (56) 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 51416736, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (81204480).
51416736 is an abundant number, since it is smaller than the sum of its proper divisors (110992224).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51416736 is a wasteful number, since it uses less digits than its factorization.
51416736 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4066 (or 4058 counting only the distinct ones).
The product of its digits is 15120, while the sum is 33.
The square root of 51416736 is about 7170.5464226933. The cubic root of 51416736 is about 371.8503271157.
The spelling of 51416736 in words is "fifty-one million, four hundred sixteen thousand, seven hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •