Base | Representation |
---|---|
bin | 1101000000011… |
… | …0000011010100 |
3 | 10210122110112210 |
4 | 3100012003110 |
5 | 102431110430 |
6 | 5225113420 |
7 | 1231450026 |
oct | 320060324 |
9 | 123573483 |
10 | 54550740 |
11 | 28879862 |
12 | 16328870 |
13 | b3bc85a |
14 | 7360016 |
15 | 4bc82b0 |
hex | 34060d4 |
54550740 has 96 divisors (see below), whose sum is σ = 160030080. Its totient is φ = 13866496.
The previous prime is 54550723. The next prime is 54550747. The reversal of 54550740 is 4705545.
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 = 54550698 and 54550707.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (54550747) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 186034 + ... + 186326.
It is an arithmetic number, because the mean of its divisors is an integer number (1666980).
Almost surely, 254550740 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 54550740, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (80015040).
54550740 is an abundant number, since it is smaller than the sum of its proper divisors (105479340).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
54550740 is a wasteful number, since it uses less digits than its factorization.
54550740 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 441 (or 439 counting only the distinct ones).
The product of its (nonzero) digits is 14000, while the sum is 30.
The square root of 54550740 is about 7385.8472770563. The cubic root of 54550740 is about 379.2569505786.
The spelling of 54550740 in words is "fifty-four million, five hundred fifty thousand, seven hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •