Base | Representation |
---|---|
bin | 1100111000110… |
… | …1010011001100 |
3 | 10202201100002021 |
4 | 3032031103030 |
5 | 102314244030 |
6 | 5210335524 |
7 | 1224320035 |
oct | 316152314 |
9 | 122640067 |
10 | 54056140 |
11 | 285711a6 |
12 | 1612a5a4 |
13 | b2786a8 |
14 | 7271a8c |
15 | 4b2b97a |
hex | 338d4cc |
54056140 has 36 divisors (see below), whose sum is σ = 119822976. Its totient is φ = 20481696.
The previous prime is 54056129. The next prime is 54056143. The reversal of 54056140 is 4165045.
54056140 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not an unprimeable number, because it can be changed into a prime (54056143) by changing a digit.
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 11 ways as a sum of consecutive naturals, for example, 3477 + ... + 10963.
It is an arithmetic number, because the mean of its divisors is an integer number (3328416).
Almost surely, 254056140 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 54056140, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (59911488).
54056140 is an abundant number, since it is smaller than the sum of its proper divisors (65766836).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
54056140 is a wasteful number, since it uses less digits than its factorization.
54056140 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7534 (or 7513 counting only the distinct ones).
The product of its (nonzero) digits is 2400, while the sum is 25.
The square root of 54056140 is about 7352.2880792308. The cubic root of 54056140 is about 378.1072547281.
The spelling of 54056140 in words is "fifty-four million, fifty-six thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •