Base | Representation |
---|---|
bin | 1101000011011… |
… | …1001100001011 |
3 | 10211000200122021 |
4 | 3100313030023 |
5 | 103004031021 |
6 | 5233305311 |
7 | 1233245566 |
oct | 320671413 |
9 | 124020567 |
10 | 54752011 |
11 | 289a6aa6 |
12 | 16405237 |
13 | b460352 |
14 | 73b34dd |
15 | 4c17c41 |
hex | 343730b |
54752011 has 4 divisors (see below), whose sum is σ = 54813024. Its totient is φ = 54691000.
The previous prime is 54751997. The next prime is 54752017. The reversal of 54752011 is 11025745.
54752011 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 11025745 = 5 ⋅2205149.
It is a cyclic number.
It is not a de Polignac number, because 54752011 - 25 = 54751979 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (54752017) 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 3 ways as a sum of consecutive naturals, for example, 29140 + ... + 30961.
It is an arithmetic number, because the mean of its divisors is an integer number (13703256).
Almost surely, 254752011 is an apocalyptic number.
54752011 is a deficient number, since it is larger than the sum of its proper divisors (61013).
54752011 is an equidigital number, since it uses as much as digits as its factorization.
54752011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 61012.
The product of its (nonzero) digits is 1400, while the sum is 25.
The square root of 54752011 is about 7399.4601830134. The cubic root of 54752011 is about 379.7228149430.
Adding to 54752011 its reverse (11025745), we get a palindrome (65777756).
The spelling of 54752011 in words is "fifty-four million, seven hundred fifty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •