Recognised as Number

26,094

Positive
Even
Composite
5 digits

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

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value26,094

Digit count5

Digit sum21

Digit product0zero, because one of the digits is zero

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

Digital root3repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 3 × 4,349

Distinct prime factors32, 3, 4,349

Number of divisors8

Sum of divisors σ(n)52,200

Aliquot sum26,106sum of the proper divisors

ClassificationAbundantthe aliquot sum exceeds the number

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

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

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

SquarefreeYesno repeated prime factor

All divisors1, 2, 3, 6, 4,349, 8,698, 13,047, 26,0948 in total

Arithmetic

Previous number26,093

Next number26,095

Double52,188

Half13,047

Square680,896,836

Cube17,767,322,038,584

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

Cube root29.660619621≈

Negation-26,094

Reciprocal0.000038323≈

Representations

Decimal26,094

Binary11001011110111015 bits

Octal62756

Hexadecimal65EE

Base 36K4U

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

In wordstwenty-six thousand and ninety-four

Ordinaltwenty-six thousand and ninety-fourth

Scientific notation2.6094 × 10^4

Engineering notation26.094 × 10^3

In other bases

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

Quinary1313334base 5; one hand: 7 digits

Septenary136035base 7: 6 digits

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

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

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

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

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

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

Bit-level

0110010111101110

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 even

Highest set bitbit 14worth 16,384

Lowest set bitbit 11 trailing zero

Power of twoNo

Bytes265 ee

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

At each machine width

16-bit0110010111101110

32-bit00000000000000000110010111101110

64-bit0000000000000000000000000000000000000000000000000110010111101110

One's complement1001101000010001at 16 bits, every bit flipped

Bits reversed0111011110100110at 16 bits

Rotated left by 11100101111011100at 16 bits, wrapping

Shifted left by 11100101111011100= 52,188, no wrap

Shifted right by 111001011110111= 13,047, discarding the low bit

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

Nearest landmarks

Next prime26,099+5

Previous prime26,083−11

Distance to nearest prime5

Nearest square below25,921

Nearest square above26,244

Powers & multiples

26,094 to the power 2680,896,836

26,094 to the power 317,767,322,038,584

26,094 to the power 4463,620,501,274,810,896

26,094 to the power 512,097,713,360,264,915,520,224

First ten multiples26,094, 52,188, 78,282, 104,376, 130,470, 156,564, 182,658, 208,752, 234,846, 260,940

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

Divisibility tests

Divisible by 2Yes

Divisible by 3Yes

Divisible by 4No, remainder 2

Divisible by 5No, remainder 4

Divisible by 6Yes

Divisible by 7No, remainder 5

Divisible by 8No, remainder 6

Divisible by 9No, remainder 3

Divisible by 10No, remainder 4

Divisible by 11No, remainder 2

Divisible by 12No, remainder 6

Divisible by 100No, remainder 94

Collatz (3n + 1) trajectory

Steps to reach 1201the total stopping time

Highest value reached190,9967× the starting value

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

First steps26,094 → 13,047 → 39,142 → 19,571 → 58,714 → 29,357 → 88,072 → 44,036 → 22,018 → 11,009 → …

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

As a percentage & fraction

As a percentage2,609,400%

26,094% as a decimal260.94

26,094% of 10026,094

26,094% of 1,000260,940

As a fraction of 10026,094/100

Read another way

As seconds7 hours, 14 minutes and 54 seconds

As bytes25.482 KiB

As a 24-bit colour#0065EE

Keep nerding

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