Recognised as Number

26,939

Positive
Odd
Composite
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value26,939

Digit count5

Digit sum29

Digit product2,916

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

Digital root2repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation11 × 31 × 79

Distinct prime factors311, 31, 79

Number of divisors8

Sum of divisors σ(n)30,720

Aliquot sum3,781sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)390the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 23,400

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

SquarefreeYesno repeated prime factor

All divisors1, 11, 31, 79, 341, 869, 2,449, 26,9398 in total

Arithmetic

Previous number26,938

Next number26,940

Double53,878

Half13,469.5

Square725,709,721

Cube19,549,894,174,019

Square root164.131045205≈irrational, shown to 9 decimal places

Cube root29.977390372≈

Negation-26,939

Reciprocal0.0000371209≈

Representations

Decimal26,939

Binary11010010011101115 bits

Octal64473

Hexadecimal693B

Base 36KSB

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

In wordstwenty-six thousand, nine hundred and thirty-nine

Ordinaltwenty-six thousand, nine hundred and thirty-ninth

Scientific notation2.6939 × 10^4

Engineering notation26.939 × 10^3

In other bases

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

Quinary1330224base 5; one hand: 7 digits

Septenary141353base 7: 6 digits

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

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

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

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

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

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

Bit-level

0110100100111011

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 odd

Highest set bitbit 14worth 16,384

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes269 3b

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

At each machine width

16-bit0110100100111011

32-bit00000000000000000110100100111011

64-bit0000000000000000000000000000000000000000000000000110100100111011

One's complement1001011011000100at 16 bits, every bit flipped

Bits reversed1101110010010110at 16 bits

Rotated left by 11101001001110110at 16 bits, wrapping

Shifted left by 11101001001110110= 53,878, no wrap

Shifted right by 111010010011101= 13,469, discarding the low bit

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

Nearest landmarks

Next prime26,947+8

Previous prime26,927−12

Distance to nearest prime8

Nearest square below26,896

Nearest square above27,225

Powers & multiples

26,939 to the power 2725,709,721

26,939 to the power 319,549,894,174,019

26,939 to the power 4526,654,599,153,897,841

26,939 to the power 514,187,548,246,606,853,938,699

First ten multiples26,939, 53,878, 80,817, 107,756, 134,695, 161,634, 188,573, 215,512, 242,451, 269,390

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

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 2

Divisible by 4No, remainder 3

Divisible by 5No, remainder 4

Divisible by 6No, remainder 5

Divisible by 7No, remainder 3

Divisible by 8No, remainder 3

Divisible by 9No, remainder 2

Divisible by 10No, remainder 9

Divisible by 11Yes

Divisible by 12No, remainder 11

Divisible by 100No, remainder 39

Collatz (3n + 1) trajectory

Steps to reach 190the total stopping time

Highest value reached136,3845× the starting value

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

First steps26,939 → 80,818 → 40,409 → 121,228 → 60,614 → 30,307 → 90,922 → 45,461 → 136,384 → 68,192 → …

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

As a percentage & fraction

As a percentage2,693,900%

26,939% as a decimal269.39

26,939% of 10026,939

26,939% of 1,000269,390

As a fraction of 10026,939/100

Read another way

As seconds7 hours, 28 minutes and 59 seconds

As bytes26.308 KiB

As a 24-bit colour#00693B

Keep nerding

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