Base | Representation |
---|---|
bin | 1100001011000… |
… | …0010111000100 |
3 | 10120001210221122 |
4 | 3002300113010 |
5 | 101032212040 |
6 | 5022133112 |
7 | 1156644353 |
oct | 302602704 |
9 | 116053848 |
10 | 51054020 |
11 | 26900706 |
12 | 15121198 |
13 | a7670a4 |
14 | 6acd99a |
15 | 47371b5 |
hex | 30b05c4 |
51054020 has 48 divisors (see below), whose sum is σ = 114645888. Its totient is φ = 19050240.
The previous prime is 51054019. The next prime is 51054023. The reversal of 51054020 is 2045015.
51054020 = T465 + T466 + ... + T740.
It is a self number, because there is not a number n which added to its sum of digits gives 51054020.
It is not an unprimeable number, because it can be changed into a prime (51054023) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 17507 + ... + 20213.
It is an arithmetic number, because the mean of its divisors is an integer number (2388456).
Almost surely, 251054020 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 51054020, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (57322944).
51054020 is an abundant number, since it is smaller than the sum of its proper divisors (63591868).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51054020 is a wasteful number, since it uses less digits than its factorization.
51054020 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2780 (or 2778 counting only the distinct ones).
The product of its (nonzero) digits is 200, while the sum is 17.
The square root of 51054020 is about 7145.2095840500. The cubic root of 51054020 is about 370.9738649574.
Adding to 51054020 its reverse (2045015), we get a palindrome (53099035).
The spelling of 51054020 in words is "fifty-one million, fifty-four thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •