Base | Representation |
---|---|
bin | 1100001100010… |
… | …0001000000000 |
3 | 10120012221000000 |
4 | 3003010020000 |
5 | 101042304401 |
6 | 5024000000 |
7 | 1160432364 |
oct | 303041000 |
9 | 116187000 |
10 | 51134976 |
11 | 26956512 |
12 | 15160000 |
13 | a794ba9 |
14 | 6b112a4 |
15 | 4751186 |
hex | 30c4200 |
51134976 has 140 divisors (see below), whose sum is σ = 154303182. Its totient is φ = 16920576.
The previous prime is 51134939. The next prime is 51135001. The reversal of 51134976 is 67943115.
It can be written as a sum of positive squares in only one way, i.e., 41990400 + 9144576 = 6480^2 + 3024^2 .
It is a super-2 number, since 2×511349762 = 5229571541041152, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a self number, because there is not a number n which added to its sum of digits gives 51134976.
It is an unprimeable number.
It is a polite number, since it can be written in 13 ways as a sum of consecutive naturals, for example, 373180 + ... + 373316.
Almost surely, 251134976 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 51134976, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (77151591).
51134976 is an abundant number, since it is smaller than the sum of its proper divisors (103168206).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51134976 is an frugal number, since it uses more digits than its factorization.
51134976 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 173 (or 142 counting only the distinct ones).
The product of its digits is 22680, while the sum is 36.
The square root of 51134976 is about 7150.8723943306. The cubic root of 51134976 is about 371.1698449543.
The spelling of 51134976 in words is "fifty-one million, one hundred thirty-four thousand, nine hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •