Nerdulator> put something in

Recognised as Number

55,940

  • Positive
  • Even
  • Composite
  • 5 digits

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

Number properties

ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value55,940
Digit count5
Digit sum23
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2^2 × 5 × 2,797
Distinct prime factors32, 5, 2,797
Number of divisors12
Sum of divisors σ(n)117,516
Aliquot sum61,576sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)22,368integers below n that share no factor with it
Carmichael function λ(n)2,796the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 22,368
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 5, 10, 20, 2,797, 5,594, 11,188, 13,985, 27,970, 55,94012 in total

Arithmetic

Previous number55,939
Next number55,941
Double111,880
Half27,970
Square root236.51638421≈irrational, shown to 9 decimal places
Cube root38.244954978≈
Negation-55,940
Reciprocal0.0000178763≈

Representations

Decimal55,940
Binary110110101000010016 bits
Octal155204
HexadecimalDA84
Base 36175W
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfifty-five thousand, nine hundred and forty
Ordinalfifty-five thousand, nine hundred and fortieth
Scientific notation5.594 × 10^4
Engineering notation55.94 × 10^3

In other bases

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

Bit-level

1101101010000100
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 22 trailing zeros
Power of twoNo
Bytes2da 84
Gray code1011011111000110n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1101101010000100
32-bit00000000000000001101101010000100
64-bit0000000000000000000000000000000000000000000000001101101010000100
One's complement0010010101111011at 16 bits, every bit flipped
Bits reversed0010000101011011at 16 bits
Rotated left by 11011010100001001at 16 bits, wrapping
Shifted left by 111011010100001000= 111,880, no wrap
Shifted right by 1110110101000010= 27,970, discarding the low bit
These bits as a double2.76380322 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime55,949+9
Previous prime55,933−7
Distance to nearest prime7
Nearest square below55,696
Nearest square above56,169

Powers & multiples

55,940 to the power 23,129,283,600
55,940 to the power 3175,052,124,584,000
55,940 to the power 49,792,415,849,228,960,000
55,940 to the power 5547,787,742,605,868,022,400,000
First ten multiples55,940, 111,880, 167,820, 223,760, 279,700, 335,640, 391,580, 447,520, 503,460, 559,400
Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)

Divisibility tests

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

Collatz (3n + 1) trajectory

Steps to reach 160the total stopping time
Highest value reached55,940
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps55,940 → 27,970 → 13,985 → 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,000%
55,940% as a decimal559.4
55,940% of 10055,940
55,940% of 1,000559,400
As a fraction of 10055,940/100

Read another way

As bytes54.629 KiB
As a 24-bit colour#00DA84

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 “55940” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.