Recognised as Number

26,092

Positive
Even
Composite
5 digits

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

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value26,092

Digit count5

Digit sum19

Digit product0zero, because one of the digits is zero

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

Digital root1repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2^2 × 11 × 593

Distinct prime factors32, 11, 593

Number of divisors12

Sum of divisors σ(n)49,896

Aliquot sum23,804sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

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

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

SquarefreeNohas a repeated prime factor

All divisors1, 2, 4, 11, 22, 44, 593, 1,186, 2,372, 6,523, 13,046, 26,09212 in total

Arithmetic

Previous number26,091

Next number26,093

Double52,184

Half13,046

Square680,792,464

Cube17,763,236,970,688

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

Cube root29.659861812≈

Negation-26,092

Reciprocal0.0000383259≈

Representations

Decimal26,092

Binary11001011110110015 bits

Octal62754

Hexadecimal65EC

Base 36K4S

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

In wordstwenty-six thousand and ninety-two

Ordinaltwenty-six thousand and ninety-second

Scientific notation2.6092 × 10^4

Engineering notation26.092 × 10^3

In other bases

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

Quinary1313332base 5; one hand: 7 digits

Septenary136033base 7: 6 digits

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

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

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

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

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

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

Bit-level

0110010111101100

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 22 trailing zeros

Power of twoNo

Bytes265 ec

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

At each machine width

16-bit0110010111101100

32-bit00000000000000000110010111101100

64-bit0000000000000000000000000000000000000000000000000110010111101100

One's complement1001101000010011at 16 bits, every bit flipped

Bits reversed0011011110100110at 16 bits

Rotated left by 11100101111011000at 16 bits, wrapping

Shifted left by 11100101111011000= 52,184, no wrap

Shifted right by 111001011110110= 13,046, discarding the low bit

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

Nearest landmarks

Next prime26,099+7

Previous prime26,083−9

Distance to nearest prime7

Nearest square below25,921

Nearest square above26,244

Powers & multiples

26,092 to the power 2680,792,464

26,092 to the power 317,763,236,970,688

26,092 to the power 4463,478,379,039,191,296

26,092 to the power 512,093,077,865,890,579,295,232

First ten multiples26,092, 52,184, 78,276, 104,368, 130,460, 156,552, 182,644, 208,736, 234,828, 260,920

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

Divisibility tests

Divisible by 2Yes

Divisible by 3No, remainder 1

Divisible by 4Yes

Divisible by 5No, remainder 2

Divisible by 6No, remainder 4

Divisible by 7No, remainder 3

Divisible by 8No, remainder 4

Divisible by 9No, remainder 1

Divisible by 10No, remainder 2

Divisible by 11Yes

Divisible by 12No, remainder 4

Divisible by 100No, remainder 92

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,092 → 13,046 → 6,523 → 19,570 → 9,785 → 29,356 → 14,678 → 7,339 → 22,018 → 11,009 → …

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

As a percentage & fraction

As a percentage2,609,200%

26,092% as a decimal260.92

26,092% of 10026,092

26,092% of 1,000260,920

As a fraction of 10026,092/100

Read another way

As seconds7 hours, 14 minutes and 52 seconds

As bytes25.48 KiB

As a 24-bit colour#0065EC

Keep nerding

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