Recognised as Number
55,176
- Positive
- Even
- Composite
- 5 digits
55,176 is an even 5-digit integer and a composite number. It has 48 divisors and a digital root of 6.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value55,176
Digit count5
Digit sum24
Digit product1,050
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root6repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberYesdivisible by its own digit sum
Factors & divisors
Prime factorisation2^3 × 3 × 11^2 × 19
Distinct prime factors42, 3, 11, 19
Number of divisors48
Sum of divisors σ(n)159,600
Aliquot sum104,424sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)15,840integers below n that share no factor with it
Carmichael function λ(n)990the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 15,840
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 3, 4, 6, 8, 11, 12, 19, 22, 24, 33, 38, 44, 57, 66, 76, 88, 114, 121, 132, 152, 209, 228, 242, 264, 363, 418, 456, 484, 627, 726, 836, 968, 1,254, 1,452, 1,672, 2,299, 2,508, 2,904, 4,598, 5,016, 6,897, 9,196, 13,794, 18,392, 27,588, 55,17648 in total
Arithmetic
Representations
Decimal55,176
Binary110101111000100016 bits
Octal153610
HexadecimalD788
Base 3616KO
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfifty-five thousand, one hundred and seventy-six
Ordinalfifty-five thousand, one hundred and seventy-sixth
Scientific notation5.5176 × 10^4
Engineering notation55.176 × 10^3
In other bases
Ternary2210200120base 3; the most digit-efficient integer base after e: 10 digits
Quinary3231201base 5; one hand: 7 digits
Septenary316602base 7: 6 digits
Nonary83616base 9; each digit is two ternary digits: 5 digits
Duodecimal27b20base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal6higbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal15:19:36base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary10T11T01TT0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10010100010011000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1101011110001000
Bit length16 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits8within that length
Bit parityeven8 set bits, so even; not the same as the number itself being even
Highest set bitbit 15worth 32,768
Lowest set bitbit 33 trailing zeros
Power of twoNo
Bytes2d7 88
Gray code1011110001001100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1101011110001000
32-bit00000000000000001101011110001000
64-bit0000000000000000000000000000000000000000000000001101011110001000
One's complement0010100001110111at 16 bits, every bit flipped
Bits reversed0001000111101011at 16 bits
Rotated left by 11010111100010001at 16 bits, wrapping
Shifted left by 111010111100010000= 110,352, no wrap
Shifted right by 1110101111000100= 27,588, discarding the low bit
These bits as a double2.72605661 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
55,176 to the power 23,044,390,976
55,176 to the power 3167,977,316,491,776
55,176 to the power 49,268,316,414,750,232,576
55,176 to the power 5511,388,626,500,258,832,613,376
First ten multiples55,176, 110,352, 165,528, 220,704, 275,880, 331,056, 386,232, 441,408, 496,584, 551,760
Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)
Divisibility tests
Divisible by 2Yes
Divisible by 3Yes
Divisible by 4Yes
Divisible by 5No, remainder 1
Divisible by 6Yes
Divisible by 7No, remainder 2
Divisible by 8Yes
Divisible by 9No, remainder 6
Divisible by 10No, remainder 6
Divisible by 11Yes
Divisible by 12Yes
Divisible by 100No, remainder 76
Collatz (3n + 1) trajectory
Steps to reach 1109the total stopping time
Highest value reached55,176
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps55,176 → 27,588 → 13,794 → 6,897 → 20,692 → 10,346 → 5,173 → 15,520 → 7,760 → 3,880 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage5,517,600%
55,176% as a decimal551.76
55,176% of 10055,176
55,176% of 1,000551,760
As a fraction of 10055,176/100
Read another way
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from 55,176
Nerdulate something else
Nothing in mind? Surprise me · today’s page