Recognised as Number

56,562

Positive
Even
Composite
5 digits

56,562 is an even 5-digit integer and a composite number. It has 16 divisors and a digital root of 6.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value56,562

Digit count5

Digit sum24

Digit product1,800

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 factorisation2 × 3 × 11 × 857

Distinct prime factors42, 3, 11, 857

Number of divisors16

Sum of divisors σ(n)123,552

Aliquot sum66,990sum of the proper divisors

ClassificationAbundantthe aliquot sum exceeds the number

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

Carmichael function λ(n)4,280the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 17,120

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

SquarefreeYesno repeated prime factor

All divisors1, 2, 3, 6, 11, 22, 33, 66, 857, 1,714, 2,571, 5,142, 9,427, 18,854, 28,281, 56,56216 in total

Arithmetic

Previous number56,561

Next number56,563

Double113,124

Half28,281

Square3,199,259,844

Cube180,956,535,296,328

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

Cube root38.386182094≈

Negation-56,562

Reciprocal0.0000176797≈

Representations

Decimal56,562

Binary110111001111001016 bits

Octal156362

HexadecimalDCF2

Base 3617N6

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

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

Ordinalfifty-six thousand, five hundred and sixty-second

Scientific notation5.6562 × 10^4

Engineering notation56.562 × 10^3

In other bases

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

Quinary3302222base 5; one hand: 7 digits

Septenary323622base 7: 6 digits

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

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

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

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

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

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

Bit-level

1101110011110010

Bit length16 bitsto write the magnitude

Set bits10the population count, or Hamming weight

Zero bits6within that length

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

Highest set bitbit 15worth 32,768

Lowest set bitbit 11 trailing zero

Power of twoNo

Bytes2dc f2

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

At each machine width

16-bit1101110011110010

32-bit00000000000000001101110011110010

64-bit0000000000000000000000000000000000000000000000001101110011110010

One's complement0010001100001101at 16 bits, every bit flipped

Bits reversed0100111100111011at 16 bits

Rotated left by 11011100111100101at 16 bits, wrapping

Shifted left by 111011100111100100= 113,124, no wrap

Shifted right by 1110111001111001= 28,281, discarding the low bit

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

Nearest landmarks

Next prime56,569+7

Previous prime56,543−19

Distance to nearest prime7

Nearest square below56,169

Nearest square above56,644

Powers & multiples

56,562 to the power 23,199,259,844

56,562 to the power 3180,956,535,296,328

56,562 to the power 410,235,263,549,430,904,336

56,562 to the power 5578,926,976,882,910,811,052,832

First ten multiples56,562, 113,124, 169,686, 226,248, 282,810, 339,372, 395,934, 452,496, 509,058, 565,620

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

Divisibility tests

Divisible by 2Yes

Divisible by 3Yes

Divisible by 4No, remainder 2

Divisible by 5No, remainder 2

Divisible by 6Yes

Divisible by 7No, remainder 2

Divisible by 8No, remainder 2

Divisible by 9No, remainder 6

Divisible by 10No, remainder 2

Divisible by 11Yes

Divisible by 12No, remainder 6

Divisible by 100No, remainder 62

Collatz (3n + 1) trajectory

Steps to reach 1228the total stopping time

Highest value reached2,480,05643× the starting value

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

First steps56,562 → 28,281 → 84,844 → 42,422 → 21,211 → 63,634 → 31,817 → 95,452 → 47,726 → 23,863 → …

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

As a percentage & fraction

As a percentage5,656,200%

56,562% as a decimal565.62

56,562% of 10056,562

56,562% of 1,000565,620

As a fraction of 10056,562/100

Read another way

As seconds15 hours, 42 minutes and 42 seconds

As bytes55.236 KiB

As a 24-bit colour#00DCF2

Keep nerding

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