Recognised as Number

56,539

Positive
Odd
Composite
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value56,539

Digit count5

Digit sum28

Digit product4,050

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

Digital root1repeated digit sum

PalindromicNoreads differently backwards

Happy numberYessquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation7 × 41 × 197

Distinct prime factors37, 41, 197

Number of divisors8

Sum of divisors σ(n)66,528

Aliquot sum9,989sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)5,880the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 47,040

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

SquarefreeYesno repeated prime factor

All divisors1, 7, 41, 197, 287, 1,379, 8,077, 56,5398 in total

Arithmetic

Previous number56,538

Next number56,540

Double113,078

Half28,269.5

Square3,196,658,521

Cube180,735,876,118,819

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

Cube root38.380978354≈

Negation-56,539

Reciprocal0.0000176869≈

Representations

Decimal56,539

Binary110111001101101116 bits

Octal156333

HexadecimalDCDB

Base 3617MJ

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

In wordsfifty-six thousand, five hundred and thirty-nine

Ordinalfifty-six thousand, five hundred and thirty-ninth

Scientific notation5.6539 × 10^4

Engineering notation56.539 × 10^3

In other bases

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

Quinary3302124base 5; one hand: 7 digits

Septenary323560base 7: 6 digits

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

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

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

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

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

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

Bit-level

1101110011011011

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 db

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

At each machine width

16-bit1101110011011011

32-bit00000000000000001101110011011011

64-bit0000000000000000000000000000000000000000000000001101110011011011

One's complement0010001100100100at 16 bits, every bit flipped

Bits reversed1101101100111011at 16 bits

Rotated left by 11011100110110111at 16 bits, wrapping

Shifted left by 111011100110110110= 113,078, no wrap

Shifted right by 1110111001101101= 28,269, discarding the low bit

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

Nearest landmarks

Next prime56,543+4

Previous prime56,533−6

Distance to nearest prime4

Nearest square below56,169

Nearest square above56,644

Powers & multiples

56,539 to the power 23,196,658,521

56,539 to the power 3180,735,876,118,819

56,539 to the power 410,218,625,699,881,907,441

56,539 to the power 5577,750,878,445,623,164,806,699

First ten multiples56,539, 113,078, 169,617, 226,156, 282,695, 339,234, 395,773, 452,312, 508,851, 565,390

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 4

Divisible by 6No, remainder 1

Divisible by 7Yes

Divisible by 8No, remainder 3

Divisible by 9No, remainder 1

Divisible by 10No, remainder 9

Divisible by 11No, remainder 10

Divisible by 12No, remainder 7

Divisible by 100No, remainder 39

Collatz (3n + 1) trajectory

Steps to reach 1135the total stopping time

Highest value reached429,3527× the starting value

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

First steps56,539 → 169,618 → 84,809 → 254,428 → 127,214 → 63,607 → 190,822 → 95,411 → 286,234 → 143,117 → …

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

As a percentage & fraction

As a percentage5,653,900%

56,539% as a decimal565.39

56,539% of 10056,539

56,539% of 1,000565,390

As a fraction of 10056,539/100

Read another way

As seconds15 hours, 42 minutes and 19 seconds

As bytes55.214 KiB

As a 24-bit colour#00DCDB

Keep nerding

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