Recognised as Number

26,091

Positive
Odd
Composite
5 digits

26,091 is an odd 5-digit integer and a composite number. It has 12 divisors and a digital root of 9.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value26,091

Digit count5

Digit sum18

Digit product0zero, because one of the digits is zero

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

Digital root9repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3^2 × 13 × 223

Distinct prime factors33, 13, 223

Number of divisors12

Sum of divisors σ(n)40,768

Aliquot sum14,677sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)444the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 15,984

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

SquarefreeNohas a repeated prime factor

All divisors1, 3, 9, 13, 39, 117, 223, 669, 2,007, 2,899, 8,697, 26,09112 in total

Arithmetic

Previous number26,090

Next number26,092

Double52,182

Half13,045.5

Square680,740,281

Cube17,761,194,671,571

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

Cube root29.659482894≈

Negation-26,091

Reciprocal0.0000383274≈

Representations

Decimal26,091

Binary11001011110101115 bits

Octal62753

Hexadecimal65EB

Base 36K4R

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

In wordstwenty-six thousand and ninety-one

Ordinaltwenty-six thousand and ninety-first

Scientific notation2.6091 × 10^4

Engineering notation26.091 × 10^3

In other bases

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

Quinary1313331base 5; one hand: 7 digits

Septenary136032base 7: 6 digits

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

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

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

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

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

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

Bit-level

0110010111101011

Bit length15 bitsto write the magnitude

Set bits10the population count, or Hamming weight

Zero bits5within that length

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

Highest set bitbit 14worth 16,384

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes265 eb

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

At each machine width

16-bit0110010111101011

32-bit00000000000000000110010111101011

64-bit0000000000000000000000000000000000000000000000000110010111101011

One's complement1001101000010100at 16 bits, every bit flipped

Bits reversed1101011110100110at 16 bits

Rotated left by 11100101111010110at 16 bits, wrapping

Shifted left by 11100101111010110= 52,182, no wrap

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

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

Nearest landmarks

Next prime26,099+8

Previous prime26,083−8

Distance to nearest prime8

Nearest square below25,921

Nearest square above26,244

Powers & multiples

26,091 to the power 2680,740,281

26,091 to the power 317,761,194,671,571

26,091 to the power 4463,407,330,175,958,961

26,091 to the power 512,090,760,651,620,945,251,451

First ten multiples26,091, 52,182, 78,273, 104,364, 130,455, 156,546, 182,637, 208,728, 234,819, 260,910

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

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3Yes

Divisible by 4No, remainder 3

Divisible by 5No, remainder 1

Divisible by 6No, remainder 3

Divisible by 7No, remainder 2

Divisible by 8No, remainder 3

Divisible by 9Yes

Divisible by 10No, remainder 1

Divisible by 11No, remainder 10

Divisible by 12No, remainder 3

Divisible by 100No, remainder 91

Collatz (3n + 1) trajectory

Steps to reach 182the total stopping time

Highest value reached1,692,73664× the starting value

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

First steps26,091 → 78,274 → 39,137 → 117,412 → 58,706 → 29,353 → 88,060 → 44,030 → 22,015 → 66,046 → …

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

As a percentage & fraction

As a percentage2,609,100%

26,091% as a decimal260.91

26,091% of 10026,091

26,091% of 1,000260,910

As a fraction of 10026,091/100

Read another way

As seconds7 hours, 14 minutes and 51 seconds

As bytes25.479 KiB

As a 24-bit colour#0065EB

Keep nerding

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