Recognised as Number

55,941

Positive
Odd
Composite
5 digits

55,941 is an odd 5-digit integer and a composite number. It has 8 divisors and a digital root of 6.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value55,941

Digit count5

Digit sum24

Digit product900

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 numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3 × 29 × 643

Distinct prime factors33, 29, 643

Number of divisors8

Sum of divisors σ(n)77,280

Aliquot sum21,339sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)8,988the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 35,952

Möbius function μ(n)−13 distinct prime factors, an odd number of them

SquarefreeYesno repeated prime factor

All divisors1, 3, 29, 87, 643, 1,929, 18,647, 55,9418 in total

Arithmetic

Previous number55,940

Next number55,942

Double111,882

Half27,970.5

Square3,129,395,481

Cube175,061,512,602,621

Square root236.518498219≈irrational, shown to 9 decimal places

Cube root38.24518287≈

Negation-55,941

Reciprocal0.000017876≈

Representations

Decimal55,941

Binary110110101000010116 bits

Octal155205

HexadecimalDA85

Base 36175X

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

In wordsfifty-five thousand, nine hundred and forty-one

Ordinalfifty-five thousand, nine hundred and forty-first

Scientific notation5.5941 × 10^4

Engineering notation55.941 × 10^3

In other bases

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

Quinary3242231base 5; one hand: 7 digits

Septenary322044base 7: 6 digits

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

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

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

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

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

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

Bit-level

1101101010000101

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 odd

Highest set bitbit 15worth 32,768

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes2da 85

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

At each machine width

16-bit1101101010000101

32-bit00000000000000001101101010000101

64-bit0000000000000000000000000000000000000000000000001101101010000101

One's complement0010010101111010at 16 bits, every bit flipped

Bits reversed1010000101011011at 16 bits

Rotated left by 11011010100001011at 16 bits, wrapping

Shifted left by 111011010100001010= 111,882, no wrap

Shifted right by 1110110101000010= 27,970, discarding the low bit

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

Nearest landmarks

Next prime55,949+8

Previous prime55,933−8

Distance to nearest prime8

Nearest square below55,696

Nearest square above56,169

Powers & multiples

55,941 to the power 23,129,395,481

55,941 to the power 3175,061,512,602,621

55,941 to the power 49,793,116,076,503,221,361

55,941 to the power 5547,836,706,435,666,706,155,701

First ten multiples55,941, 111,882, 167,823, 223,764, 279,705, 335,646, 391,587, 447,528, 503,469, 559,410

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

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3Yes

Divisible by 4No, remainder 1

Divisible by 5No, remainder 1

Divisible by 6No, remainder 3

Divisible by 7No, remainder 4

Divisible by 8No, remainder 5

Divisible by 9No, remainder 6

Divisible by 10No, remainder 1

Divisible by 11No, remainder 6

Divisible by 12No, remainder 9

Divisible by 100No, remainder 41

Collatz (3n + 1) trajectory

Steps to reach 160the total stopping time

Highest value reached167,8243× the starting value

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

First steps55,941 → 167,824 → 83,912 → 41,956 → 20,978 → 10,489 → 31,468 → 15,734 → 7,867 → 23,602 → …

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

As a percentage & fraction

As a percentage5,594,100%

55,941% as a decimal559.41

55,941% of 10055,941

55,941% of 1,000559,410

As a fraction of 10055,941/100

Read another way

As seconds15 hours, 32 minutes and 21 seconds

As bytes54.63 KiB

As a 24-bit colour#00DA85

Keep nerding

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