Recognised as Number

59,530

Positive
Even
Composite
5 digits

59,530 is an even 5-digit integer and a composite number. It has 8 divisors and a digital root of 4.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value59,530

Digit count5

Digit sum22

Digit product0zero, because one of the digits is zero

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

Digital root4repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 5 × 5,953

Distinct prime factors32, 5, 5,953

Number of divisors8

Sum of divisors σ(n)107,172

Aliquot sum47,642sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

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

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

SquarefreeYesno repeated prime factor

All divisors1, 2, 5, 10, 5,953, 11,906, 29,765, 59,5308 in total

Arithmetic

Previous number59,529

Next number59,531

Double119,060

Half29,765

Square3,543,820,900

Cube210,963,658,177,000

Square root243.987704608≈irrational, shown to 9 decimal places

Cube root39.046186788≈

Negation-59,530

Reciprocal0.0000167983≈

Representations

Decimal59,530

Binary111010001000101016 bits

Octal164212

HexadecimalE88A

Base 3619XM

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

In wordsfifty-nine thousand, five hundred and thirty

Ordinalfifty-nine thousand, five hundred and thirtieth

Scientific notation5.953 × 10^4

Engineering notation59.53 × 10^3

In other bases

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

Quinary3401110base 5; one hand: 7 digits

Septenary335362base 7: 6 digits

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

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

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

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

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

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

Bit-level

1110100010001010

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

Bytes2e8 8a

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

At each machine width

16-bit1110100010001010

32-bit00000000000000001110100010001010

64-bit0000000000000000000000000000000000000000000000001110100010001010

One's complement0001011101110101at 16 bits, every bit flipped

Bits reversed0101000100010111at 16 bits

Rotated left by 11101000100010101at 16 bits, wrapping

Shifted left by 111101000100010100= 119,060, no wrap

Shifted right by 1111010001000101= 29,765, discarding the low bit

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

Nearest landmarks

Next prime59,539+9

Previous prime59,513−17

Distance to nearest prime9

Nearest square below59,049

Nearest square above59,536

Powers & multiples

59,530 to the power 23,543,820,900

59,530 to the power 3210,963,658,177,000

59,530 to the power 412,558,666,571,276,810,000

59,530 to the power 5747,617,420,988,108,499,300,000

First ten multiples59,530, 119,060, 178,590, 238,120, 297,650, 357,180, 416,710, 476,240, 535,770, 595,300

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

Divisibility tests

Divisible by 2Yes

Divisible by 3No, remainder 1

Divisible by 4No, remainder 2

Divisible by 5Yes

Divisible by 6No, remainder 4

Divisible by 7No, remainder 2

Divisible by 8No, remainder 2

Divisible by 9No, remainder 4

Divisible by 10Yes

Divisible by 11No, remainder 9

Divisible by 12No, remainder 10

Divisible by 100No, remainder 30

Collatz (3n + 1) trajectory

Steps to reach 1135the total stopping time

Highest value reached89,2961× the starting value

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

First steps59,530 → 29,765 → 89,296 → 44,648 → 22,324 → 11,162 → 5,581 → 16,744 → 8,372 → 4,186 → …

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

As a percentage & fraction

As a percentage5,953,000%

59,530% as a decimal595.3

59,530% of 10059,530

59,530% of 1,000595,300

As a fraction of 10059,530/100

Read another way

As seconds16 hours, 32 minutes and 10 seconds

As bytes58.135 KiB

As a 24-bit colour#00E88A

Keep nerding

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