Base | Representation |
---|---|
bin | 1100111000011… |
… | …1110010010001 |
3 | 10202200012002201 |
4 | 3032013302101 |
5 | 102313033203 |
6 | 5210043201 |
7 | 1224164140 |
oct | 316076221 |
9 | 122605081 |
10 | 54033553 |
11 | 28556232 |
12 | 16119501 |
13 | b26b322 |
14 | 7267757 |
15 | 4b24e1d |
hex | 3387c91 |
54033553 has 8 divisors (see below), whose sum is σ = 62918208. Its totient is φ = 45440304.
The previous prime is 54033533. The next prime is 54033563. The reversal of 54033553 is 35533045.
54033553 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 54033553 - 25 = 54033521 is a prime.
It is not an unprimeable number, because it can be changed into a prime (54033533) 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 7 ways as a sum of consecutive naturals, for example, 72451 + ... + 73192.
It is an arithmetic number, because the mean of its divisors is an integer number (7864776).
Almost surely, 254033553 is an apocalyptic number.
54033553 is a gapful number since it is divisible by the number (53) formed by its first and last digit.
It is an amenable number.
54033553 is a deficient number, since it is larger than the sum of its proper divisors (8884655).
54033553 is a wasteful number, since it uses less digits than its factorization.
54033553 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 145703.
The product of its (nonzero) digits is 13500, while the sum is 28.
The square root of 54033553 is about 7350.7518663059. The cubic root of 54033553 is about 378.0545841875.
Adding to 54033553 its reverse (35533045), we get a palindrome (89566598).
The spelling of 54033553 in words is "fifty-four million, thirty-three thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •