Base | Representation |
---|---|
bin | 1100001011101… |
… | …1010001100000 |
3 | 10120011002021012 |
4 | 3002323101200 |
5 | 101040124340 |
6 | 5023120052 |
7 | 1160221601 |
oct | 302732140 |
9 | 116132235 |
10 | 51098720 |
11 | 26931252 |
12 | 15143028 |
13 | a78153a |
14 | 6b01da8 |
15 | 4745565 |
hex | 30bb460 |
51098720 has 48 divisors (see below), whose sum is σ = 122789520. Its totient is φ = 20089344.
The previous prime is 51098699. The next prime is 51098737. The reversal of 51098720 is 2789015.
It is a super-2 number, since 2×510987202 = 5222158371276800, 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 (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6734 + ... + 12146.
It is an arithmetic number, because the mean of its divisors is an integer number (2558115).
Almost surely, 251098720 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 51098720, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (61394760).
51098720 is an abundant number, since it is smaller than the sum of its proper divisors (71690800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51098720 is a wasteful number, since it uses less digits than its factorization.
51098720 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5487 (or 5479 counting only the distinct ones).
The product of its (nonzero) digits is 5040, while the sum is 32.
The square root of 51098720 is about 7148.3368695103. The cubic root of 51098720 is about 371.0821012565.
The spelling of 51098720 in words is "fifty-one million, ninety-eight thousand, seven hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •