Recognised as Number

56,083

Positive
Odd
Composite
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value56,083

Digit count5

Digit sum22

Digit product0zero, because one of the digits is zero

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

Digital root4repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation17 × 3,299

Distinct prime factors217, 3,299

Number of divisors4

Sum of divisors σ(n)59,400

Aliquot sum3,317sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)26,384the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 52,768

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

SquarefreeYesno repeated prime factor

All divisors1, 17, 3,299, 56,0834 in total

Arithmetic

Previous number56,082

Next number56,084

Double112,166

Half28,041.5

Square3,145,302,889

Cube176,398,021,923,787

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

Cube root38.277515907≈

Negation-56,083

Reciprocal0.0000178307≈

Representations

Decimal56,083

Binary110110110001001116 bits

Octal155423

HexadecimalDB13

Base 36179V

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

In wordsfifty-six thousand and eighty-three

Ordinalfifty-six thousand and eighty-third

Scientific notation5.6083 × 10^4

Engineering notation56.083 × 10^3

In other bases

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

Quinary3243313base 5; one hand: 7 digits

Septenary322336base 7: 6 digits

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

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

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

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

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

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

Bit-level

1101101100010011

Bit length16 bitsto write the magnitude

Set bits9the population count, or Hamming weight

Zero bits7within that length

Bit parityodd9 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

Bytes2db 13

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

At each machine width

16-bit1101101100010011

32-bit00000000000000001101101100010011

64-bit0000000000000000000000000000000000000000000000001101101100010011

One's complement0010010011101100at 16 bits, every bit flipped

Bits reversed1100100011011011at 16 bits

Rotated left by 11011011000100111at 16 bits, wrapping

Shifted left by 111011011000100110= 112,166, no wrap

Shifted right by 1110110110001001= 28,041, discarding the low bit

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

Nearest landmarks

Next prime56,087+4

Previous prime56,081−2

Distance to nearest prime2

Nearest square below55,696

Nearest square above56,169

Powers & multiples

56,083 to the power 23,145,302,889

56,083 to the power 3176,398,021,923,787

56,083 to the power 49,892,930,263,551,746,321

56,083 to the power 5554,825,207,970,772,588,920,643

First ten multiples56,083, 112,166, 168,249, 224,332, 280,415, 336,498, 392,581, 448,664, 504,747, 560,830

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 3

Divisible by 5No, remainder 3

Divisible by 6No, remainder 1

Divisible by 7No, remainder 6

Divisible by 8No, remainder 3

Divisible by 9No, remainder 4

Divisible by 10No, remainder 3

Divisible by 11No, remainder 5

Divisible by 12No, remainder 7

Divisible by 100No, remainder 83

Collatz (3n + 1) trajectory

Steps to reach 191the total stopping time

Highest value reached252,3764× the starting value

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

First steps56,083 → 168,250 → 84,125 → 252,376 → 126,188 → 63,094 → 31,547 → 94,642 → 47,321 → 141,964 → …

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

As a percentage & fraction

As a percentage5,608,300%

56,083% as a decimal560.83

56,083% of 10056,083

56,083% of 1,000560,830

As a fraction of 10056,083/100

Read another way

As seconds15 hours, 34 minutes and 43 seconds

As bytes54.769 KiB

As a 24-bit colour#00DB13

Keep nerding

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