Recognised as Number

21,590

Positive
Even
Composite
5 digits

21,590 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 value21,590

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 numberNosquared-digit sums reach 1

Harshad numberYesdivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 5 × 17 × 127

Distinct prime factors42, 5, 17, 127

Number of divisors16

Sum of divisors σ(n)41,472

Aliquot sum19,882sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)1,008the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 8,064

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

SquarefreeYesno repeated prime factor

All divisors1, 2, 5, 10, 17, 34, 85, 127, 170, 254, 635, 1,270, 2,159, 4,318, 10,795, 21,59016 in total

Arithmetic

Previous number21,589

Next number21,591

Double43,180

Half10,795

Square466,128,100

Cube10,063,705,679,000

Square root146.935359938≈irrational, shown to 9 decimal places

Cube root27.845234571≈

Negation-21,590

Reciprocal0.0000463177≈

Representations

Decimal21,590

Binary10101000101011015 bits

Octal52126

Hexadecimal5456

Base 36GNQ

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

In wordstwenty-one thousand, five hundred and ninety

Ordinaltwenty-one thousand, five hundred and ninetieth

Scientific notation2.159 × 10^4

Engineering notation21.59 × 10^3

In other bases

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

Quinary1142330base 5; one hand: 7 digits

Septenary116642base 7: 6 digits

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

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

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

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

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

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

Bit-level

0101010001010110

Bit length15 bitsto write the magnitude

Set bits7the population count, or Hamming weight

Zero bits8within that length

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

Highest set bitbit 14worth 16,384

Lowest set bitbit 11 trailing zero

Power of twoNo

Bytes254 56

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

At each machine width

16-bit0101010001010110

32-bit00000000000000000101010001010110

64-bit0000000000000000000000000000000000000000000000000101010001010110

One's complement1010101110101001at 16 bits, every bit flipped

Bits reversed0110101000101010at 16 bits

Rotated left by 11010100010101100at 16 bits, wrapping

Shifted left by 11010100010101100= 43,180, no wrap

Shifted right by 110101000101011= 10,795, discarding the low bit

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

Nearest landmarks

Next prime21,599+9

Previous prime21,589−1

Distance to nearest prime1

Nearest square below21,316

Nearest square above21,609

Powers & multiples

21,590 to the power 2466,128,100

21,590 to the power 310,063,705,679,000

21,590 to the power 4217,275,405,609,610,000

21,590 to the power 54,690,976,007,111,479,900,000

First ten multiples21,590, 43,180, 64,770, 86,360, 107,950, 129,540, 151,130, 172,720, 194,310, 215,900

Powers of twoBetween 2^14 (16,384) and 2^15 (32,768)

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 2

Divisible by 8No, remainder 6

Divisible by 9No, remainder 8

Divisible by 10Yes

Divisible by 11No, remainder 8

Divisible by 12No, remainder 2

Divisible by 100No, remainder 90

Collatz (3n + 1) trajectory

Steps to reach 169the total stopping time

Highest value reached48,5802× the starting value

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

First steps21,590 → 10,795 → 32,386 → 16,193 → 48,580 → 24,290 → 12,145 → 36,436 → 18,218 → 9,109 → …

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

As a percentage & fraction

As a percentage2,159,000%

21,590% as a decimal215.9

21,590% of 10021,590

21,590% of 1,000215,900

As a fraction of 10021,590/100

Read another way

As seconds5 hours, 59 minutes and 50 seconds

As bytes21.084 KiB

As a 24-bit colour#005456

Keep nerding

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