Base | Representation |
---|---|
bin | 1100111011000… |
… | …0101011110000 |
3 | 10202222200220010 |
4 | 3032300223300 |
5 | 102333413242 |
6 | 5213414520 |
7 | 1225462422 |
oct | 316605360 |
9 | 122880803 |
10 | 54201072 |
11 | 28660082 |
12 | 1619a440 |
13 | b2c9653 |
14 | 72ac812 |
15 | 4b5989c |
hex | 33b0af0 |
54201072 has 80 divisors (see below), whose sum is σ = 149077760. Its totient is φ = 16920576.
The previous prime is 54201067. The next prime is 54201109. The reversal of 54201072 is 27010245.
54201072 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 93648 + ... + 94224.
It is an arithmetic number, because the mean of its divisors is an integer number (1863472).
Almost surely, 254201072 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 54201072, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (74538880).
54201072 is an abundant number, since it is smaller than the sum of its proper divisors (94876688).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
54201072 is a wasteful number, since it uses less digits than its factorization.
54201072 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 710 (or 704 counting only the distinct ones).
The product of its (nonzero) digits is 560, while the sum is 21.
The square root of 54201072 is about 7362.1377330229. The cubic root of 54201072 is about 378.4448724846. Note that the first 3 decimals are identical.
The spelling of 54201072 in words is "fifty-four million, two hundred one thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •