Base | Representation |
---|---|
bin | 1101001001111… |
… | …0000101010000 |
3 | 10211211002202100 |
4 | 3102132011100 |
5 | 103111022311 |
6 | 5250320400 |
7 | 1236652362 |
oct | 322360520 |
9 | 124732670 |
10 | 55173456 |
11 | 291646a8 |
12 | 16589100 |
13 | b57a120 |
14 | 7482d32 |
15 | 4c9ca56 |
hex | 349e150 |
55173456 has 60 divisors (see below), whose sum is σ = 166292308. Its totient is φ = 16975872.
The previous prime is 55173451. The next prime is 55173491. The reversal of 55173456 is 65437155.
It can be written as a sum of positive squares in 2 ways, for example, as 10497600 + 44675856 = 3240^2 + 6684^2 .
It is a super-2 number, since 2×551734562 = 6088220493967872, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a self number, because there is not a number n which added to its sum of digits gives 55173456.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (55173451) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 12865 + ... + 16608.
Almost surely, 255173456 is an apocalyptic number.
It is an amenable number.
55173456 is an abundant number, since it is smaller than the sum of its proper divisors (111118852).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
55173456 is a wasteful number, since it uses less digits than its factorization.
55173456 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29500 (or 29491 counting only the distinct ones).
The product of its digits is 63000, while the sum is 36.
The square root of 55173456 is about 7427.8836824495. The cubic root of 55173456 is about 380.6946113390.
The spelling of 55173456 in words is "fifty-five million, one hundred seventy-three thousand, four hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •