Recognised as Number

56,404

Positive
Even
Composite
5 digits

56,404 is an even 5-digit integer and a composite number. It has 12 divisors and a digital root of 1.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value56,404

Digit count5

Digit sum19

Digit product0zero, because one of the digits is zero

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

Digital root1repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2^2 × 59 × 239

Distinct prime factors32, 59, 239

Number of divisors12

Sum of divisors σ(n)100,800

Aliquot sum44,396sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)6,902the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 27,608

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

SquarefreeNohas a repeated prime factor

All divisors1, 2, 4, 59, 118, 236, 239, 478, 956, 14,101, 28,202, 56,40412 in total

Arithmetic

Previous number56,403

Next number56,405

Double112,808

Half28,202

Square3,181,411,216

Cube179,444,318,227,264

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

Cube root38.350406174≈

Negation-56,404

Reciprocal0.0000177292≈

Representations

Decimal56,404

Binary110111000101010016 bits

Octal156124

HexadecimalDC54

Base 3617IS

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

In wordsfifty-six thousand, four hundred and four

Ordinalfifty-six thousand, four hundred and fourth

Scientific notation5.6404 × 10^4

Engineering notation56.404 × 10^3

In other bases

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

Quinary3301104base 5; one hand: 7 digits

Septenary323305base 7: 6 digits

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

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

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

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

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

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

Bit-level

1101110001010100

Bit length16 bitsto write the magnitude

Set bits8the population count, or Hamming weight

Zero bits8within that length

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

Highest set bitbit 15worth 32,768

Lowest set bitbit 22 trailing zeros

Power of twoNo

Bytes2dc 54

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

At each machine width

16-bit1101110001010100

32-bit00000000000000001101110001010100

64-bit0000000000000000000000000000000000000000000000001101110001010100

One's complement0010001110101011at 16 bits, every bit flipped

Bits reversed0010101000111011at 16 bits

Rotated left by 11011100010101001at 16 bits, wrapping

Shifted left by 111011100010101000= 112,808, no wrap

Shifted right by 1110111000101010= 28,202, discarding the low bit

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

Nearest landmarks

Next prime56,417+13

Previous prime56,401−3

Distance to nearest prime3

Nearest square below56,169

Nearest square above56,644

Powers & multiples

56,404 to the power 23,181,411,216

56,404 to the power 3179,444,318,227,264

56,404 to the power 410,121,377,325,290,598,656

56,404 to the power 5570,886,166,655,690,926,593,024

First ten multiples56,404, 112,808, 169,212, 225,616, 282,020, 338,424, 394,828, 451,232, 507,636, 564,040

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

Divisibility tests

Divisible by 2Yes

Divisible by 3No, remainder 1

Divisible by 4Yes

Divisible by 5No, remainder 4

Divisible by 6No, remainder 4

Divisible by 7No, remainder 5

Divisible by 8No, remainder 4

Divisible by 9No, remainder 1

Divisible by 10No, remainder 4

Divisible by 11No, remainder 7

Divisible by 12No, remainder 4

Divisible by 100No, remainder 4

Collatz (3n + 1) trajectory

Steps to reach 1122the total stopping time

Highest value reached56,404

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

First steps56,404 → 28,202 → 14,101 → 42,304 → 21,152 → 10,576 → 5,288 → 2,644 → 1,322 → 661 → …

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

As a percentage & fraction

As a percentage5,640,400%

56,404% as a decimal564.04

56,404% of 10056,404

56,404% of 1,000564,040

As a fraction of 10056,404/100

Read another way

As seconds15 hours, 40 minutes and 4 seconds

As bytes55.082 KiB

As a 24-bit colour#00DC54

Keep nerding

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