Recognised as Number

59,604

Positive
Even
Composite
5 digits

59,604 is an even 5-digit integer and a composite number. It has 12 divisors and a digital root of 6.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value59,604

Digit count5

Digit sum24

Digit product0zero, because one of the digits is zero

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

Digital root6repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2^2 × 3 × 4,967

Distinct prime factors32, 3, 4,967

Number of divisors12

Sum of divisors σ(n)139,104

Aliquot sum79,500sum of the proper divisors

ClassificationAbundantthe aliquot sum exceeds the number

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

Carmichael function λ(n)4,966the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 19,864

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

SquarefreeNohas a repeated prime factor

All divisors1, 2, 3, 4, 6, 12, 4,967, 9,934, 14,901, 19,868, 29,802, 59,60412 in total

Arithmetic

Previous number59,603

Next number59,605

Double119,208

Half29,802

Square3,552,636,816

Cube211,751,364,780,864

Square root244.139304496≈irrational, shown to 9 decimal places

Cube root39.062359146≈

Negation-59,604

Reciprocal0.0000167774≈

Representations

Decimal59,604

Binary111010001101010016 bits

Octal164324

HexadecimalE8D4

Base 3619ZO

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

In wordsfifty-nine thousand, six hundred and four

Ordinalfifty-nine thousand, six hundred and fourth

Scientific notation5.9604 × 10^4

Engineering notation59.604 × 10^3

In other bases

Ternary10000202120base 3; the most digit-efficient integer base after e: 11 digits

Quinary3401404base 5; one hand: 7 digits

Septenary335526base 7: 6 digits

Nonary100676base 9; each digit is two ternary digits: 6 digits

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

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

Sexagesimal16:33:24base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

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

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

Bit-level

1110100011010100

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

Bytes2e8 d4

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

At each machine width

16-bit1110100011010100

32-bit00000000000000001110100011010100

64-bit0000000000000000000000000000000000000000000000001110100011010100

One's complement0001011100101011at 16 bits, every bit flipped

Bits reversed0010101100010111at 16 bits

Rotated left by 11101000110101001at 16 bits, wrapping

Shifted left by 111101000110101000= 119,208, no wrap

Shifted right by 1111010001101010= 29,802, discarding the low bit

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

Nearest landmarks

Next prime59,611+7

Previous prime59,581−23

Distance to nearest prime7

Nearest square below59,536

Nearest square above60,025

Powers & multiples

59,604 to the power 23,552,636,816

59,604 to the power 3211,751,364,780,864

59,604 to the power 412,621,228,346,398,617,856

59,604 to the power 5752,275,694,358,743,218,689,024

First ten multiples59,604, 119,208, 178,812, 238,416, 298,020, 357,624, 417,228, 476,832, 536,436, 596,040

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

Divisibility tests

Divisible by 2Yes

Divisible by 3Yes

Divisible by 4Yes

Divisible by 5No, remainder 4

Divisible by 6Yes

Divisible by 7No, remainder 6

Divisible by 8No, remainder 4

Divisible by 9No, remainder 6

Divisible by 10No, remainder 4

Divisible by 11No, remainder 6

Divisible by 12Yes

Divisible by 100No, remainder 4

Collatz (3n + 1) trajectory

Steps to reach 142the total stopping time

Highest value reached59,604

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

First steps59,604 → 29,802 → 14,901 → 44,704 → 22,352 → 11,176 → 5,588 → 2,794 → 1,397 → 4,192 → …

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

As a percentage & fraction

As a percentage5,960,400%

59,604% as a decimal596.04

59,604% of 10059,604

59,604% of 1,000596,040

As a fraction of 10059,604/100

Read another way

As seconds16 hours, 33 minutes and 24 seconds

As bytes58.207 KiB

As a 24-bit colour#00E8D4

Keep nerding

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