Recognised as Number

59,090

Positive
Even
Composite
5 digits

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

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value59,090

Digit count5

Digit sum23

Digit product0zero, because one of the digits is zero

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

Digital root5repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 5 × 19 × 311

Distinct prime factors42, 5, 19, 311

Number of divisors16

Sum of divisors σ(n)112,320

Aliquot sum53,230sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

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

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

SquarefreeYesno repeated prime factor

All divisors1, 2, 5, 10, 19, 38, 95, 190, 311, 622, 1,555, 3,110, 5,909, 11,818, 29,545, 59,09016 in total

Arithmetic

Previous number59,089

Next number59,091

Double118,180

Half29,545

Square3,491,628,100

Cube206,320,304,429,000

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

Cube root38.949748999≈

Negation-59,090

Reciprocal0.0000169233≈

Representations

Decimal59,090

Binary111001101101001016 bits

Octal163322

HexadecimalE6D2

Base 3619LE

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

In wordsfifty-nine thousand and ninety

Ordinalfifty-nine thousand and ninetieth

Scientific notation5.909 × 10^4

Engineering notation59.09 × 10^3

In other bases

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

Quinary3342330base 5; one hand: 7 digits

Septenary334163base 7: 6 digits

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

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

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

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

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

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

Bit-level

1110011011010010

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 even

Highest set bitbit 15worth 32,768

Lowest set bitbit 11 trailing zero

Power of twoNo

Bytes2e6 d2

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

At each machine width

16-bit1110011011010010

32-bit00000000000000001110011011010010

64-bit0000000000000000000000000000000000000000000000001110011011010010

One's complement0001100100101101at 16 bits, every bit flipped

Bits reversed0100101101100111at 16 bits

Rotated left by 11100110110100101at 16 bits, wrapping

Shifted left by 111100110110100100= 118,180, no wrap

Shifted right by 1111001101101001= 29,545, discarding the low bit

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

Nearest landmarks

Next prime59,093+3

Previous prime59,083−7

Distance to nearest prime3

Nearest square below59,049

Nearest square above59,536

Powers & multiples

59,090 to the power 23,491,628,100

59,090 to the power 3206,320,304,429,000

59,090 to the power 412,191,466,788,709,610,000

59,090 to the power 5720,393,772,544,850,854,900,000

First ten multiples59,090, 118,180, 177,270, 236,360, 295,450, 354,540, 413,630, 472,720, 531,810, 590,900

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 3

Divisible by 8No, remainder 2

Divisible by 9No, remainder 5

Divisible by 10Yes

Divisible by 11No, remainder 9

Divisible by 12No, remainder 2

Divisible by 100No, remainder 90

Collatz (3n + 1) trajectory

Steps to reach 147the total stopping time

Highest value reached224,3683× the starting value

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

First steps59,090 → 29,545 → 88,636 → 44,318 → 22,159 → 66,478 → 33,239 → 99,718 → 49,859 → 149,578 → …

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

As a percentage & fraction

As a percentage5,909,000%

59,090% as a decimal590.9

59,090% of 10059,090

59,090% of 1,000590,900

As a fraction of 10059,090/100

Read another way

As seconds16 hours, 24 minutes and 50 seconds

As bytes57.705 KiB

As a 24-bit colour#00E6D2

Keep nerding

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