Recognised as Number

56,330

Positive
Even
Composite
5 digits

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

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value56,330

Digit count5

Digit sum17

Digit product0zero, because one of the digits is zero

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

Digital root8repeated digit sum

PalindromicNoreads differently backwards

Happy numberYessquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 5 × 43 × 131

Distinct prime factors42, 5, 43, 131

Number of divisors16

Sum of divisors σ(n)104,544

Aliquot sum48,214sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

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

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

SquarefreeYesno repeated prime factor

All divisors1, 2, 5, 10, 43, 86, 131, 215, 262, 430, 655, 1,310, 5,633, 11,266, 28,165, 56,33016 in total

Arithmetic

Previous number56,329

Next number56,331

Double112,660

Half28,165

Square3,173,068,900

Cube178,738,971,137,000

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

Cube root38.333627387≈

Negation-56,330

Reciprocal0.0000177525≈

Representations

Decimal56,330

Binary110111000000101016 bits

Octal156012

HexadecimalDC0A

Base 3617GQ

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

In wordsfifty-six thousand, three hundred and thirty

Ordinalfifty-six thousand, three hundred and thirtieth

Scientific notation5.633 × 10^4

Engineering notation56.33 × 10^3

In other bases

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

Quinary3300310base 5; one hand: 7 digits

Septenary323141base 7: 6 digits

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

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

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

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

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

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

Bit-level

1101110000001010

Bit length16 bitsto write the magnitude

Set bits7the population count, or Hamming weight

Zero bits9within that length

Bit parityodd7 set bits, so odd; 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 0a

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

At each machine width

16-bit1101110000001010

32-bit00000000000000001101110000001010

64-bit0000000000000000000000000000000000000000000000001101110000001010

One's complement0010001111110101at 16 bits, every bit flipped

Bits reversed0101000000111011at 16 bits

Rotated left by 11011100000010101at 16 bits, wrapping

Shifted left by 111011100000010100= 112,660, no wrap

Shifted right by 1110111000000101= 28,165, discarding the low bit

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

Nearest landmarks

Next prime56,333+3

Previous prime56,311−19

Distance to nearest prime3

Nearest square below56,169

Nearest square above56,644

Powers & multiples

56,330 to the power 23,173,068,900

56,330 to the power 3178,738,971,137,000

56,330 to the power 410,068,366,244,147,210,000

56,330 to the power 5567,151,070,532,812,339,300,000

First ten multiples56,330, 112,660, 168,990, 225,320, 281,650, 337,980, 394,310, 450,640, 506,970, 563,300

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

Divisibility tests

Divisible by 2Yes

Divisible by 3No, remainder 2

Divisible by 4No, remainder 2

Divisible by 5Yes

Divisible by 6No, remainder 2

Divisible by 7No, remainder 1

Divisible by 8No, remainder 2

Divisible by 9No, remainder 8

Divisible by 10Yes

Divisible by 11No, remainder 10

Divisible by 12No, remainder 2

Divisible by 100No, remainder 30

Collatz (3n + 1) trajectory

Steps to reach 160the total stopping time

Highest value reached84,4961× the starting value

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

First steps56,330 → 28,165 → 84,496 → 42,248 → 21,124 → 10,562 → 5,281 → 15,844 → 7,922 → 3,961 → …

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

As a percentage & fraction

As a percentage5,633,000%

56,330% as a decimal563.3

56,330% of 10056,330

56,330% of 1,000563,300

As a fraction of 10056,330/100

Read another way

As seconds15 hours, 38 minutes and 50 seconds

As bytes55.01 KiB

As a 24-bit colour#00DC0A

Keep nerding

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