Base | Representation |
---|---|
bin | 1101001100001… |
… | …1110100100011 |
3 | 10212002221210111 |
4 | 3103003310203 |
5 | 103130444120 |
6 | 5253512151 |
7 | 1241165140 |
oct | 323036443 |
9 | 125087714 |
10 | 55328035 |
11 | 2925a854 |
12 | 16642657 |
13 | b6025a9 |
14 | 74c33c7 |
15 | 4ccd75a |
hex | 34c3d23 |
55328035 has 8 divisors (see below), whose sum is σ = 75878496. Its totient is φ = 37939200.
The previous prime is 55328033. The next prime is 55328059. The reversal of 55328035 is 53082355.
55328035 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 55328035 - 21 = 55328033 is a prime.
It is a super-2 number, since 2×553280352 = 6122382913922450, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 55327988 and 55328006.
It is not an unprimeable number, because it can be changed into a prime (55328033) 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, 790366 + ... + 790435.
It is an arithmetic number, because the mean of its divisors is an integer number (9484812).
Almost surely, 255328035 is an apocalyptic number.
55328035 is a deficient number, since it is larger than the sum of its proper divisors (20550461).
55328035 is a wasteful number, since it uses less digits than its factorization.
55328035 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1580813.
The product of its (nonzero) digits is 18000, while the sum is 31.
The square root of 55328035 is about 7438.2817236241. The cubic root of 55328035 is about 381.0498094394.
The spelling of 55328035 in words is "fifty-five million, three hundred twenty-eight thousand, thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •