Base | Representation |
---|---|
bin | 1100110010000… |
… | …0101001011111 |
3 | 10201212201121102 |
4 | 3030200221133 |
5 | 102211023403 |
6 | 5153023315 |
7 | 1220454410 |
oct | 314405137 |
9 | 121781542 |
10 | 53611103 |
11 | 282978a7 |
12 | 15b54b3b |
13 | b150c60 |
14 | 7197807 |
15 | 4a8eb88 |
hex | 3320a5f |
53611103 has 32 divisors (see below), whose sum is σ = 70371840. Its totient is φ = 39657600.
The previous prime is 53611097. The next prime is 53611109. The reversal of 53611103 is 30111635.
It is a happy number.
53611103 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (53611097) and next prime (53611109).
It is a cyclic number.
It is not a de Polignac number, because 53611103 - 212 = 53607007 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (53611109) 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 31 ways as a sum of consecutive naturals, for example, 174476 + ... + 174782.
It is an arithmetic number, because the mean of its divisors is an integer number (2199120).
Almost surely, 253611103 is an apocalyptic number.
53611103 is a deficient number, since it is larger than the sum of its proper divisors (16760737).
53611103 is a wasteful number, since it uses less digits than its factorization.
53611103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 447.
The product of its (nonzero) digits is 270, while the sum is 20.
The square root of 53611103 is about 7321.9603249403. The cubic root of 53611103 is about 377.0667585062.
Adding to 53611103 its reverse (30111635), we get a palindrome (83722738).
The spelling of 53611103 in words is "fifty-three million, six hundred eleven thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •