Recognised as Number

56,529

Positive
Odd
Composite
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value56,529

Digit count5

Digit sum27

Digit product2,700

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

Digital root9repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3^2 × 11 × 571

Distinct prime factors33, 11, 571

Number of divisors12

Sum of divisors σ(n)89,232

Aliquot sum32,703sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)570the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 34,200

Möbius function μ(n)0zero, because a prime divides n twice

SquarefreeNohas a repeated prime factor

All divisors1, 3, 9, 11, 33, 99, 571, 1,713, 5,139, 6,281, 18,843, 56,52912 in total

Arithmetic

Previous number56,528

Next number56,530

Double113,058

Half28,264.5

Square3,195,527,841

Cube180,639,993,323,889

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

Cube root38.378715418≈

Negation-56,529

Reciprocal0.00001769≈

Representations

Decimal56,529

Binary110111001101000116 bits

Octal156321

HexadecimalDCD1

Base 3617M9

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

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

Ordinalfifty-six thousand, five hundred and twenty-ninth

Scientific notation5.6529 × 10^4

Engineering notation56.529 × 10^3

In other bases

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

Quinary3302104base 5; one hand: 7 digits

Septenary323544base 7: 6 digits

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

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

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

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

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

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

Bit-level

1101110011010001

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

Bytes2dc d1

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

At each machine width

16-bit1101110011010001

32-bit00000000000000001101110011010001

64-bit0000000000000000000000000000000000000000000000001101110011010001

One's complement0010001100101110at 16 bits, every bit flipped

Bits reversed1000101100111011at 16 bits

Rotated left by 11011100110100011at 16 bits, wrapping

Shifted left by 111011100110100010= 113,058, no wrap

Shifted right by 1110111001101000= 28,264, discarding the low bit

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

Nearest landmarks

Next prime56,531+2

Previous prime56,527−2

Distance to nearest prime2

Nearest square below56,169

Nearest square above56,644

Powers & multiples

56,529 to the power 23,195,527,841

56,529 to the power 3180,639,993,323,889

56,529 to the power 410,211,398,182,606,121,281

56,529 to the power 5577,240,127,864,541,429,893,649

First ten multiples56,529, 113,058, 169,587, 226,116, 282,645, 339,174, 395,703, 452,232, 508,761, 565,290

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

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3Yes

Divisible by 4No, remainder 1

Divisible by 5No, remainder 4

Divisible by 6No, remainder 3

Divisible by 7No, remainder 4

Divisible by 8No, remainder 1

Divisible by 9Yes

Divisible by 10No, remainder 9

Divisible by 11Yes

Divisible by 12No, remainder 9

Divisible by 100No, remainder 29

Collatz (3n + 1) trajectory

Steps to reach 1166the total stopping time

Highest value reached619,64810× the starting value

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

First steps56,529 → 169,588 → 84,794 → 42,397 → 127,192 → 63,596 → 31,798 → 15,899 → 47,698 → 23,849 → …

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

As a percentage & fraction

As a percentage5,652,900%

56,529% as a decimal565.29

56,529% of 10056,529

56,529% of 1,000565,290

As a fraction of 10056,529/100

Read another way

As seconds15 hours, 42 minutes and 9 seconds

As bytes55.204 KiB

As a 24-bit colour#00DCD1

Keep nerding

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