Base | Representation |
---|---|
bin | 1101000110000… |
… | …0010111000000 |
3 | 10211100020221210 |
4 | 3101200113000 |
5 | 103024430030 |
6 | 5241050120 |
7 | 1234550325 |
oct | 321402700 |
9 | 124306853 |
10 | 54920640 |
11 | 29001765 |
12 | 16486940 |
13 | b4bc028 |
14 | 7418b4c |
15 | 4c4cbb0 |
hex | 34605c0 |
54920640 has 112 divisors (see below), whose sum is σ = 183611520. Its totient is φ = 13870080.
The previous prime is 54920633. The next prime is 54920647. The reversal of 54920640 is 4602945.
It is an interprime number because it is at equal distance from previous prime (54920633) and next prime (54920647).
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 54920598 and 54920607.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (54920647) 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, 16735 + ... + 19745.
Almost surely, 254920640 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 54920640, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (91805760).
54920640 is an abundant number, since it is smaller than the sum of its proper divisors (128690880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
54920640 is a wasteful number, since it uses less digits than its factorization.
54920640 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3050 (or 3040 counting only the distinct ones).
The product of its (nonzero) digits is 8640, while the sum is 30.
The square root of 54920640 is about 7410.8461055402. The cubic root of 54920640 is about 380.1122475419.
The spelling of 54920640 in words is "fifty-four million, nine hundred twenty thousand, six hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •