Recognised as Number

56,557

Positive
Odd
Composite
5 digits

56,557 is an odd 5-digit integer and a composite number. It has 4 divisors and a digital root of 1.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value56,557

Digit count5

Digit sum28

Digit product5,250

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

Digital root1repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation23 × 2,459

Distinct prime factors223, 2,459

Number of divisors4

Sum of divisors σ(n)59,040

Aliquot sum2,483sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)27,038the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 54,076

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

SquarefreeYesno repeated prime factor

All divisors1, 23, 2,459, 56,5574 in total

Arithmetic

Previous number56,556

Next number56,558

Double113,114

Half28,278.5

Square3,198,694,249

Cube180,908,550,640,693

Square root237.817156656≈irrational, shown to 9 decimal places

Cube root38.385050966≈

Negation-56,557

Reciprocal0.0000176813≈

Representations

Decimal56,557

Binary110111001110110116 bits

Octal156355

HexadecimalDCED

Base 3617N1

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

In wordsfifty-six thousand, five hundred and fifty-seven

Ordinalfifty-six thousand, five hundred and fifty-seventh

Scientific notation5.6557 × 10^4

Engineering notation56.557 × 10^3

In other bases

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

Quinary3302212base 5; one hand: 7 digits

Septenary323614base 7: 6 digits

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

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

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

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

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

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

Bit-level

1101110011101101

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 odd

Highest set bitbit 15worth 32,768

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes2dc ed

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

At each machine width

16-bit1101110011101101

32-bit00000000000000001101110011101101

64-bit0000000000000000000000000000000000000000000000001101110011101101

One's complement0010001100010010at 16 bits, every bit flipped

Bits reversed1011011100111011at 16 bits

Rotated left by 11011100111011011at 16 bits, wrapping

Shifted left by 111011100111011010= 113,114, no wrap

Shifted right by 1110111001110110= 28,278, discarding the low bit

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

Nearest landmarks

Next prime56,569+12

Previous prime56,543−14

Distance to nearest prime12

Nearest square below56,169

Nearest square above56,644

Powers & multiples

56,557 to the power 23,198,694,249

56,557 to the power 3180,908,550,640,693

56,557 to the power 410,231,644,898,585,674,001

56,557 to the power 5578,671,140,529,309,964,474,557

First ten multiples56,557, 113,114, 169,671, 226,228, 282,785, 339,342, 395,899, 452,456, 509,013, 565,570

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 4

Divisible by 8No, remainder 5

Divisible by 9No, remainder 1

Divisible by 10No, remainder 7

Divisible by 11No, remainder 6

Divisible by 12No, remainder 1

Divisible by 100No, remainder 57

Collatz (3n + 1) trajectory

Steps to reach 1104the total stopping time

Highest value reached169,6723× the starting value

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

First steps56,557 → 169,672 → 84,836 → 42,418 → 21,209 → 63,628 → 31,814 → 15,907 → 47,722 → 23,861 → …

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

As a percentage & fraction

As a percentage5,655,700%

56,557% as a decimal565.57

56,557% of 10056,557

56,557% of 1,000565,570

As a fraction of 10056,557/100

Read another way

As seconds15 hours, 42 minutes and 37 seconds

As bytes55.231 KiB

As a 24-bit colour#00DCED

Keep nerding

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