Recognised as Number

26,090

Positive
Even
Composite
5 digits

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

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value26,090

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 numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 5 × 2,609

Distinct prime factors32, 5, 2,609

Number of divisors8

Sum of divisors σ(n)46,980

Aliquot sum20,890sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

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

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

SquarefreeYesno repeated prime factor

All divisors1, 2, 5, 10, 2,609, 5,218, 13,045, 26,0908 in total

Arithmetic

Previous number26,089

Next number26,091

Double52,180

Half13,045

Square680,688,100

Cube17,759,152,529,000

Square root161.523992026≈irrational, shown to 9 decimal places

Cube root29.659103965≈

Negation-26,090

Reciprocal0.0000383289≈

Representations

Decimal26,090

Binary11001011110101015 bits

Octal62752

Hexadecimal65EA

Base 36K4Q

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

In wordstwenty-six thousand and ninety

Ordinaltwenty-six thousand and ninetieth

Scientific notation2.609 × 10^4

Engineering notation26.09 × 10^3

In other bases

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

Quinary1313330base 5; one hand: 7 digits

Septenary136031base 7: 6 digits

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

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

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

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

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

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

Bit-level

0110010111101010

Bit length15 bitsto write the magnitude

Set bits9the population count, or Hamming weight

Zero bits6within that length

Bit parityodd9 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

Bytes265 ea

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

At each machine width

16-bit0110010111101010

32-bit00000000000000000110010111101010

64-bit0000000000000000000000000000000000000000000000000110010111101010

One's complement1001101000010101at 16 bits, every bit flipped

Bits reversed0101011110100110at 16 bits

Rotated left by 11100101111010100at 16 bits, wrapping

Shifted left by 11100101111010100= 52,180, no wrap

Shifted right by 111001011110101= 13,045, discarding the low bit

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

Nearest landmarks

Next prime26,099+9

Previous prime26,083−7

Distance to nearest prime7

Nearest square below25,921

Nearest square above26,244

Powers & multiples

26,090 to the power 2680,688,100

26,090 to the power 317,759,152,529,000

26,090 to the power 4463,336,289,481,610,000

26,090 to the power 512,088,443,792,575,204,900,000

First ten multiples26,090, 52,180, 78,270, 104,360, 130,450, 156,540, 182,630, 208,720, 234,810, 260,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 1

Divisible by 8No, remainder 2

Divisible by 9No, remainder 8

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 1139the total stopping time

Highest value reached39,1361× the starting value

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

First steps26,090 → 13,045 → 39,136 → 19,568 → 9,784 → 4,892 → 2,446 → 1,223 → 3,670 → 1,835 → …

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

As a percentage & fraction

As a percentage2,609,000%

26,090% as a decimal260.9

26,090% of 10026,090

26,090% of 1,000260,900

As a fraction of 10026,090/100

Read another way

As seconds7 hours, 14 minutes and 50 seconds

As bytes25.479 KiB

As a 24-bit colour#0065EA

Keep nerding

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