Recognised as Number

55,177

Positive
Odd
Composite
5 digits

55,177 is an odd 5-digit integer and a composite number. It has 4 divisors and a digital root of 7.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value55,177

Digit count5

Digit sum25

Digit product1,225

Multiplicative persistence3times the digit product can be taken before one digit is left

Digital root7repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation23 × 2,399

Distinct prime factors223, 2,399

Number of divisors4

Sum of divisors σ(n)57,600

Aliquot sum2,423sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)52,756integers below n that share no factor with it

Carmichael function λ(n)2,398the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 52,756

Möbius function μ(n)+12 distinct prime factors, an even number of them

SquarefreeYesno repeated prime factor

All divisors1, 23, 2,399, 55,1774 in total

Arithmetic

Previous number55,176

Next number55,178

Double110,354

Half27,588.5

Square3,044,501,329

Cube167,986,449,830,233

Square root234.897850139≈irrational, shown to 9 decimal places

Cube root38.070276232≈

Negation-55,177

Reciprocal0.0000181235≈

Representations

Decimal55,177

Binary110101111000100116 bits

Octal153611

HexadecimalD789

Base 3616KP

Roman numeralNot defined above 3,999there is no agreed standard notation

In wordsfifty-five thousand, one hundred and seventy-seven

Ordinalfifty-five thousand, one hundred and seventy-seventh

Scientific notation5.5177 × 10^4

Engineering notation55.177 × 10^3

In other bases

Ternary2210200121base 3; the most digit-efficient integer base after e: 10 digits

Quinary3231202base 5; one hand: 7 digits

Septenary316603base 7: 6 digits

Nonary83617base 9; each digit is two ternary digits: 5 digits

Duodecimal27b21base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits

Vigesimal6hihbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits

Sexagesimal15:19:37base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

Balanced ternary10T11T01TT1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed

Negabinary10010100010011001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

1101011110001001

Bit length16 bitsto write the magnitude

Set bits9the population count, or Hamming weight

Zero bits7within that length

Bit parityodd9 set bits, so odd; not the same as the number itself being odd

Highest set bitbit 15worth 32,768

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes2d7 89

Gray code1011110001001101n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1101011110001001

32-bit00000000000000001101011110001001

64-bit0000000000000000000000000000000000000000000000001101011110001001

One's complement0010100001110110at 16 bits, every bit flipped

Bits reversed1001000111101011at 16 bits

Rotated left by 11010111100010011at 16 bits, wrapping

Shifted left by 111010111100010010= 110,354, no wrap

Shifted right by 1110101111000100= 27,588, discarding the low bit

These bits as a double2.72610601 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime55,201+24

Previous prime55,171−6

Distance to nearest prime6

Nearest square below54,756

Nearest square above55,225

Powers & multiples

55,177 to the power 23,044,501,329

55,177 to the power 3167,986,449,830,233

55,177 to the power 49,268,988,342,282,766,241

55,177 to the power 5511,434,969,762,136,192,879,657

First ten multiples55,177, 110,354, 165,531, 220,708, 275,885, 331,062, 386,239, 441,416, 496,593, 551,770

Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 1

Divisible by 4No, remainder 1

Divisible by 5No, remainder 2

Divisible by 6No, remainder 1

Divisible by 7No, remainder 3

Divisible by 8No, remainder 1

Divisible by 9No, remainder 7

Divisible by 10No, remainder 7

Divisible by 11No, remainder 1

Divisible by 12No, remainder 1

Divisible by 100No, remainder 77

Collatz (3n + 1) trajectory

Steps to reach 191the total stopping time

Highest value reached314,2605× the starting value

Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven

First steps55,177 → 165,532 → 82,766 → 41,383 → 124,150 → 62,075 → 186,226 → 93,113 → 279,340 → 139,670 → …

Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage5,517,700%

55,177% as a decimal551.77

55,177% of 10055,177

55,177% of 1,000551,770

As a fraction of 10055,177/100

Read another way

As seconds15 hours, 19 minutes and 37 seconds

As bytes53.884 KiB

As a 24-bit colour#00D789

Keep nerding

Every link below is a page Nerdulator can generate from what it already knows about this value.