Base | Representation |
---|---|
bin | 1101001100010… |
… | …1001100100111 |
3 | 10212010020112020 |
4 | 3103011030213 |
5 | 103131134141 |
6 | 5253554223 |
7 | 1241220441 |
oct | 323051447 |
9 | 125106466 |
10 | 55333671 |
11 | 29264008 |
12 | 16645973 |
13 | b605023 |
14 | 74c5491 |
15 | 4cd0266 |
hex | 34c5327 |
55333671 has 8 divisors (see below), whose sum is σ = 73901040. Its totient is φ = 36827712.
The previous prime is 55333639. The next prime is 55333709. The reversal of 55333671 is 17633355.
55333671 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 55333671 - 25 = 55333639 is a prime.
It is a Smith number, since the sum of its digits (33) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (55333631) 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, 13206 + ... + 16883.
It is an arithmetic number, because the mean of its divisors is an integer number (9237630).
Almost surely, 255333671 is an apocalyptic number.
55333671 is a deficient number, since it is larger than the sum of its proper divisors (18567369).
55333671 is a wasteful number, since it uses less digits than its factorization.
55333671 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30705.
The product of its digits is 28350, while the sum is 33.
The square root of 55333671 is about 7438.6605649136. The cubic root of 55333671 is about 381.0627475687.
The spelling of 55333671 in words is "fifty-five million, three hundred thirty-three thousand, six hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •