Base | Representation |
---|---|
bin | 1100110001001… |
… | …1001110000111 |
3 | 10201202221011101 |
4 | 3030103032013 |
5 | 102202243403 |
6 | 5151520531 |
7 | 1220135146 |
oct | 314231607 |
9 | 121687141 |
10 | 53556103 |
11 | 2825a547 |
12 | 15b29147 |
13 | b131c03 |
14 | 718175d |
15 | 4a7d71d |
hex | 3313387 |
53556103 has 8 divisors (see below), whose sum is σ = 56773872. Its totient is φ = 50345856.
The previous prime is 53556091. The next prime is 53556157. The reversal of 53556103 is 30165535.
It is a happy number.
53556103 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 a cyclic number.
It is not a de Polignac number, because 53556103 - 213 = 53547911 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (53556163) 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, 20476 + ... + 22942.
It is an arithmetic number, because the mean of its divisors is an integer number (7096734).
Almost surely, 253556103 is an apocalyptic number.
53556103 is a deficient number, since it is larger than the sum of its proper divisors (3217769).
53556103 is a wasteful number, since it uses less digits than its factorization.
53556103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3761.
The product of its (nonzero) digits is 6750, while the sum is 28.
The square root of 53556103 is about 7318.2035363879. The cubic root of 53556103 is about 376.9377692572.
Subtracting from 53556103 its sum of digits (28), we obtain a triangular number (53556075 = T10349).
The spelling of 53556103 in words is "fifty-three million, five hundred fifty-six thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •