Base | Representation |
---|---|
bin | 1101001000111… |
… | …1000101100011 |
3 | 10211200222111111 |
4 | 3102033011203 |
5 | 103102041120 |
6 | 5245124151 |
7 | 1236305326 |
oct | 322170543 |
9 | 124628444 |
10 | 55112035 |
11 | 29122540 |
12 | 16559657 |
13 | b558194 |
14 | 74687bd |
15 | 4c8975a |
hex | 348f163 |
55112035 has 32 divisors (see below), whose sum is σ = 75556800. Its totient is φ = 38223360.
The previous prime is 55112033. The next prime is 55112039. The reversal of 55112035 is 53021155.
55112035 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 55112035 - 21 = 55112033 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 55111997 and 55112015.
It is not an unprimeable number, because it can be changed into a prime (55112033) 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, 173697 + ... + 174013.
It is an arithmetic number, because the mean of its divisors is an integer number (2361150).
Almost surely, 255112035 is an apocalyptic number.
55112035 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
55112035 is a deficient number, since it is larger than the sum of its proper divisors (20444765).
55112035 is a wasteful number, since it uses less digits than its factorization.
55112035 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 471.
The product of its (nonzero) digits is 750, while the sum is 22.
The square root of 55112035 is about 7423.7480425995. The cubic root of 55112035 is about 380.5532914147.
It can be divided in two parts, 551120 and 35, that added together give a palindrome (551155).
The spelling of 55112035 in words is "fifty-five million, one hundred twelve thousand, thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •