Recognised as Number

26,095

Positive
Odd
Composite
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value26,095

Digit count5

Digit sum22

Digit product0zero, because one of the digits is zero

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

Digital root4repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation5 × 17 × 307

Distinct prime factors35, 17, 307

Number of divisors8

Sum of divisors σ(n)33,264

Aliquot sum7,169sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

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

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

SquarefreeYesno repeated prime factor

All divisors1, 5, 17, 85, 307, 1,535, 5,219, 26,0958 in total

Arithmetic

Previous number26,094

Next number26,096

Double52,190

Half13,047.5

Square680,949,025

Cube17,769,364,807,375

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

Cube root29.66099851≈

Negation-26,095

Reciprocal0.0000383215≈

Representations

Decimal26,095

Binary11001011110111115 bits

Octal62757

Hexadecimal65EF

Base 36K4V

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

In wordstwenty-six thousand and ninety-five

Ordinaltwenty-six thousand and ninety-fifth

Scientific notation2.6095 × 10^4

Engineering notation26.095 × 10^3

In other bases

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

Quinary1313340base 5; one hand: 7 digits

Septenary136036base 7: 6 digits

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

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

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

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

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

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

Bit-level

0110010111101111

Bit length15 bitsto write the magnitude

Set bits11the population count, or Hamming weight

Zero bits4within that length

Bit parityodd11 set bits, so odd; 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 ef

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

At each machine width

16-bit0110010111101111

32-bit00000000000000000110010111101111

64-bit0000000000000000000000000000000000000000000000000110010111101111

One's complement1001101000010000at 16 bits, every bit flipped

Bits reversed1111011110100110at 16 bits

Rotated left by 11100101111011110at 16 bits, wrapping

Shifted left by 11100101111011110= 52,190, no wrap

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

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

Nearest landmarks

Next prime26,099+4

Previous prime26,083−12

Distance to nearest prime4

Nearest square below25,921

Nearest square above26,244

Powers & multiples

26,095 to the power 2680,949,025

26,095 to the power 317,769,364,807,375

26,095 to the power 4463,691,574,648,450,625

26,095 to the power 512,100,031,640,451,319,059,375

First ten multiples26,095, 52,190, 78,285, 104,380, 130,475, 156,570, 182,665, 208,760, 234,855, 260,950

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

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 1

Divisible by 4No, remainder 3

Divisible by 5Yes

Divisible by 6No, remainder 1

Divisible by 7No, remainder 6

Divisible by 8No, remainder 7

Divisible by 9No, remainder 4

Divisible by 10No, remainder 5

Divisible by 11No, remainder 3

Divisible by 12No, remainder 7

Divisible by 100No, remainder 95

Collatz (3n + 1) trajectory

Steps to reach 1126the total stopping time

Highest value reached445,87617× the starting value

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

First steps26,095 → 78,286 → 39,143 → 117,430 → 58,715 → 176,146 → 88,073 → 264,220 → 132,110 → 66,055 → …

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

As a percentage & fraction

As a percentage2,609,500%

26,095% as a decimal260.95

26,095% of 10026,095

26,095% of 1,000260,950

As a fraction of 10026,095/100

Read another way

As seconds7 hours, 14 minutes and 55 seconds

As bytes25.483 KiB

As a 24-bit colour#0065EF

Keep nerding

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