Base | Representation |
---|---|
bin | 1100001100101… |
… | …0101111000000 |
3 | 10120021022010200 |
4 | 3003022233000 |
5 | 101044141143 |
6 | 5024325200 |
7 | 1160604330 |
oct | 303125700 |
9 | 116238120 |
10 | 51162048 |
11 | 26974893 |
12 | 15173800 |
13 | a7a4302 |
14 | 6b1b0c0 |
15 | 47591d3 |
hex | 30cabc0 |
51162048 has 84 divisors (see below), whose sum is σ = 167609520. Its totient is φ = 14616576.
The previous prime is 51162037. The next prime is 51162049. The reversal of 51162048 is 84026115.
It is a tau number, because it is divible by the number of its divisors (84).
It is a super-3 number, since 3×511620483 (a number of 24 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51162049) 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 11 ways as a sum of consecutive naturals, for example, 2313 + ... + 10376.
Almost surely, 251162048 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 51162048, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (83804760).
51162048 is an abundant number, since it is smaller than the sum of its proper divisors (116447472).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51162048 is a wasteful number, since it uses less digits than its factorization.
51162048 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12714 (or 12701 counting only the distinct ones).
The product of its (nonzero) digits is 1920, while the sum is 27.
The square root of 51162048 is about 7152.7650597514. The cubic root of 51162048 is about 371.2353352708.
The spelling of 51162048 in words is "fifty-one million, one hundred sixty-two thousand, forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •