Nerdulator> put something in

Recognised as Number

55,168

  • Positive
  • Even
  • Composite
  • 5 digits

55,168 is an even 5-digit integer and a composite number. It has 16 divisors and a digital root of 7.

Number properties

ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value55,168
Digit count5
Digit sum25
Digit product1,200
Multiplicative persistence2times 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 factorisation2^7 × 431
Distinct prime factors22, 431
Number of divisors16
Sum of divisors σ(n)110,160
Aliquot sum54,992sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)27,520integers below n that share no factor with it
Carmichael function λ(n)6,880the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 27,520
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 8, 16, 32, 64, 128, 431, 862, 1,724, 3,448, 6,896, 13,792, 27,584, 55,16816 in total

Arithmetic

Previous number55,167
Next number55,169
Double110,336
Half27,584
Square root234.878692094≈irrational, shown to 9 decimal places
Cube root38.06820622≈
Negation-55,168
Reciprocal0.0000181265≈

Representations

Decimal55,168
Binary110101111000000016 bits
Octal153600
HexadecimalD780
Base 3616KG
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfifty-five thousand, one hundred and sixty-eight
Ordinalfifty-five thousand, one hundred and sixty-eighth
Scientific notation5.5168 × 10^4
Engineering notation55.168 × 10^3

In other bases

Ternary2210200021base 3; the most digit-efficient integer base after e: 10 digits
Quinary3231133base 5; one hand: 7 digits
Septenary316561base 7: 6 digits
Nonary83607base 9; each digit is two ternary digits: 5 digits
Duodecimal27b14base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal6hi8base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal15:19:28base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary10T11T001T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10010100010000000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

1101011110000000
Bit length16 bitsto write the magnitude
Set bits7the population count, or Hamming weight
Zero bits9within that length
Bit parityodd7 set bits, so odd; not the same as the number itself being even
Highest set bitbit 15worth 32,768
Lowest set bitbit 77 trailing zeros
Power of twoNo
Bytes2d7 80
Gray code1011110001000000n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1101011110000000
32-bit00000000000000001101011110000000
64-bit0000000000000000000000000000000000000000000000001101011110000000
One's complement0010100001111111at 16 bits, every bit flipped
Bits reversed0000000111101011at 16 bits
Rotated left by 11010111100000001at 16 bits, wrapping
Shifted left by 111010111100000000= 110,336, no wrap
Shifted right by 1110101111000000= 27,584, discarding the low bit
These bits as a double2.72566135 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime55,171+3
Previous prime55,163−5
Distance to nearest prime3
Nearest square below54,756
Nearest square above55,225

Powers & multiples

55,168 to the power 23,043,508,224
55,168 to the power 3167,904,261,701,632
55,168 to the power 49,262,942,309,555,634,176
55,168 to the power 5511,018,001,333,565,226,221,568
First ten multiples55,168, 110,336, 165,504, 220,672, 275,840, 331,008, 386,176, 441,344, 496,512, 551,680
Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)

Divisibility tests

Divisible by 2Yes
Divisible by 3No, remainder 1
Divisible by 4Yes
Divisible by 5No, remainder 3
Divisible by 6No, remainder 4
Divisible by 7No, remainder 1
Divisible by 8Yes
Divisible by 9No, remainder 7
Divisible by 10No, remainder 8
Divisible by 11No, remainder 3
Divisible by 12No, remainder 4
Divisible by 100No, remainder 68

Collatz (3n + 1) trajectory

Steps to reach 147the total stopping time
Highest value reached55,168
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps55,168 → 27,584 → 13,792 → 6,896 → 3,448 → 1,724 → 862 → 431 → 1,294 → 647 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage5,516,800%
55,168% as a decimal551.68
55,168% of 10055,168
55,168% of 1,000551,680
As a fraction of 10055,168/100

Read another way

As bytes53.875 KiB
As a 24-bit colour#00D780

Keep nerding

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

Nerdulate something else

Nothing in mind? Surprise me · today’s page

Every value on this page was computed from “55168” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.