Base | Representation |
---|---|
bin | 1101001000010… |
… | …1010110101101 |
3 | 10211121221211010 |
4 | 3102011112231 |
5 | 103044302143 |
6 | 5244215433 |
7 | 1236051162 |
oct | 322052655 |
9 | 124557733 |
10 | 55072173 |
11 | 290a55a2 |
12 | 1653a579 |
13 | b542cb0 |
14 | 7458069 |
15 | 4c7ca33 |
hex | 34855ad |
55072173 has 8 divisors (see below), whose sum is σ = 79078048. Its totient is φ = 33890544.
The previous prime is 55072159. The next prime is 55072181. The reversal of 55072173 is 37127055.
55072173 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 55072173 - 217 = 54941101 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 55072173.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (55076173) 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, 706015 + ... + 706092.
It is an arithmetic number, because the mean of its divisors is an integer number (9884756).
Almost surely, 255072173 is an apocalyptic number.
It is an amenable number.
55072173 is a deficient number, since it is larger than the sum of its proper divisors (24005875).
55072173 is a wasteful number, since it uses less digits than its factorization.
55072173 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1412123.
The product of its (nonzero) digits is 7350, while the sum is 30.
The square root of 55072173 is about 7421.0627945059. The cubic root of 55072173 is about 380.4615191178.
The spelling of 55072173 in words is "fifty-five million, seventy-two thousand, one hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •