Base | Representation |
---|---|
bin | 1101010101101… |
… | …0010100011001 |
3 | 10220021021101112 |
4 | 3111122110121 |
5 | 103310210343 |
6 | 5315030105 |
7 | 1246343264 |
oct | 325322431 |
9 | 126237345 |
10 | 55944473 |
11 | 29640a02 |
12 | 1689b335 |
13 | b78a050 |
14 | 7603cdb |
15 | 4da1218 |
hex | 355a519 |
55944473 has 8 divisors (see below), whose sum is σ = 60566016. Its totient is φ = 51368400.
The previous prime is 55944457. The next prime is 55944479. The reversal of 55944473 is 37444955.
55944473 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 a cyclic number.
It is not a de Polignac number, because 55944473 - 24 = 55944457 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 55944473.
It is not an unprimeable number, because it can be changed into a prime (55944479) 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, 8783 + ... + 13748.
It is an arithmetic number, because the mean of its divisors is an integer number (7570752).
Almost surely, 255944473 is an apocalyptic number.
It is an amenable number.
55944473 is a deficient number, since it is larger than the sum of its proper divisors (4621543).
55944473 is a wasteful number, since it uses less digits than its factorization.
55944473 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22735.
The product of its digits is 302400, while the sum is 41.
The square root of 55944473 is about 7479.6037996675. The cubic root of 55944473 is about 382.4597431539.
The spelling of 55944473 in words is "fifty-five million, nine hundred forty-four thousand, four hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •