Recognised as Number

55,162

Positive
Even
Composite
5 digits

55,162 is an even 5-digit integer and a composite number. It has 4 divisors and a digital root of 1.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value55,162

Digit count5

Digit sum19

Digit product300

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

Digital root1repeated digit sum

PalindromicNoreads differently backwards

Happy numberYessquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 27,581

Distinct prime factors22, 27,581

Number of divisors4

Sum of divisors σ(n)82,746

Aliquot sum27,584sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)27,580the smallest exponent with aˣ ≡ 1 for every unit coprime to n

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

SquarefreeYesno repeated prime factor

All divisors1, 2, 27,581, 55,1624 in total

Arithmetic

Previous number55,161

Next number55,163

Double110,324

Half27,581

Square3,042,846,244

Cube167,849,484,511,528

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

Cube root38.066826087≈

Negation-55,162

Reciprocal0.0000181284≈

Representations

Decimal55,162

Binary110101110111101016 bits

Octal153572

HexadecimalD77A

Base 3616KA

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

In wordsfifty-five thousand, one hundred and sixty-two

Ordinalfifty-five thousand, one hundred and sixty-second

Scientific notation5.5162 × 10^4

Engineering notation55.162 × 10^3

In other bases

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

Quinary3231122base 5; one hand: 7 digits

Septenary316552base 7: 6 digits

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

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

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

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

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

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

Bit-level

1101011101111010

Bit length16 bitsto write the magnitude

Set bits11the population count, or Hamming weight

Zero bits5within that length

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

Highest set bitbit 15worth 32,768

Lowest set bitbit 11 trailing zero

Power of twoNo

Bytes2d7 7a

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

At each machine width

16-bit1101011101111010

32-bit00000000000000001101011101111010

64-bit0000000000000000000000000000000000000000000000001101011101111010

One's complement0010100010000101at 16 bits, every bit flipped

Bits reversed0101111011101011at 16 bits

Rotated left by 11010111011110101at 16 bits, wrapping

Shifted left by 111010111011110100= 110,324, no wrap

Shifted right by 1110101110111101= 27,581, discarding the low bit

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

Nearest landmarks

Next prime55,163+1

Previous prime55,147−15

Distance to nearest prime1

Nearest square below54,756

Nearest square above55,225

Powers & multiples

55,162 to the power 23,042,846,244

55,162 to the power 3167,849,484,511,528

55,162 to the power 49,258,913,264,624,907,536

55,162 to the power 5510,740,173,503,239,149,500,832

First ten multiples55,162, 110,324, 165,486, 220,648, 275,810, 330,972, 386,134, 441,296, 496,458, 551,620

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

Divisibility tests

Divisible by 2Yes

Divisible by 3No, remainder 1

Divisible by 4No, remainder 2

Divisible by 5No, remainder 2

Divisible by 6No, remainder 4

Divisible by 7No, remainder 2

Divisible by 8No, remainder 2

Divisible by 9No, remainder 1

Divisible by 10No, remainder 2

Divisible by 11No, remainder 8

Divisible by 12No, remainder 10

Divisible by 100No, remainder 62

Collatz (3n + 1) trajectory

Steps to reach 191the total stopping time

Highest value reached176,7403× the starting value

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

First steps55,162 → 27,581 → 82,744 → 41,372 → 20,686 → 10,343 → 31,030 → 15,515 → 46,546 → 23,273 → …

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

As a percentage & fraction

As a percentage5,516,200%

55,162% as a decimal551.62

55,162% of 10055,162

55,162% of 1,000551,620

As a fraction of 10055,162/100

Read another way

As seconds15 hours, 19 minutes and 22 seconds

As bytes53.869 KiB

As a 24-bit colour#00D77A

Keep nerding

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