Base | Representation |
---|---|
bin | 1100111000110… |
… | …0011110010001 |
3 | 10202201011102211 |
4 | 3032030132101 |
5 | 102314142003 |
6 | 5210312121 |
7 | 1224304126 |
oct | 316143621 |
9 | 122634384 |
10 | 54052753 |
11 | 285696a7 |
12 | 16128641 |
13 | b276ca1 |
14 | 727074d |
15 | 4b2a96d |
hex | 338c791 |
54052753 has 4 divisors (see below), whose sum is σ = 54176320. Its totient is φ = 53929188.
The previous prime is 54052729. The next prime is 54052769. The reversal of 54052753 is 35725045.
54052753 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 a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 54052753 - 221 = 51955601 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (54052703) 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, 61125 + ... + 62002.
It is an arithmetic number, because the mean of its divisors is an integer number (13544080).
Almost surely, 254052753 is an apocalyptic number.
It is an amenable number.
54052753 is a deficient number, since it is larger than the sum of its proper divisors (123567).
54052753 is a wasteful number, since it uses less digits than its factorization.
54052753 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 123566.
The product of its (nonzero) digits is 21000, while the sum is 31.
The square root of 54052753 is about 7352.0577391639. The cubic root of 54052753 is about 378.0993575307.
Adding to 54052753 its reverse (35725045), we get a palindrome (89777798).
The spelling of 54052753 in words is "fifty-four million, fifty-two thousand, seven hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •