Nerdulator> put something in

Recognised as Number

26,782

  • Positive
  • Even
  • Composite
  • 5 digits

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

Number properties

ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value26,782
Digit count5
Digit sum25
Digit product1,344
Multiplicative persistence4times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 7 × 1,913
Distinct prime factors32, 7, 1,913
Number of divisors8
Sum of divisors σ(n)45,936
Aliquot sum19,154sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)11,472integers below n that share no factor with it
Carmichael function λ(n)5,736the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 11,472
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 7, 14, 1,913, 3,826, 13,391, 26,7828 in total

Arithmetic

Previous number26,781
Next number26,783
Double53,564
Half13,391
Square root163.652069953≈irrational, shown to 9 decimal places
Cube root29.919040977≈
Negation-26,782
Reciprocal0.0000373385≈

Representations

Decimal26,782
Binary11010001001111015 bits
Octal64236
Hexadecimal689E
Base 36KNY
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwenty-six thousand, seven hundred and eighty-two
Ordinaltwenty-six thousand, seven hundred and eighty-second
Scientific notation2.6782 × 10^4
Engineering notation26.782 × 10^3

In other bases

Ternary1100201221base 3; the most digit-efficient integer base after e: 10 digits
Quinary1324112base 5; one hand: 7 digits
Septenary141040base 7: 6 digits
Nonary40657base 9; each digit is two ternary digits: 5 digits
Duodecimal135babase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal36j2base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal7:26:22base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1101T1T0T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11011100111100010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

0110100010011110
Bit length15 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits7within that length
Bit parityeven8 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
Bytes268 9e
Gray code101110011010001n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit0110100010011110
32-bit00000000000000000110100010011110
64-bit0000000000000000000000000000000000000000000000000110100010011110
One's complement1001011101100001at 16 bits, every bit flipped
Bits reversed0111100100010110at 16 bits
Rotated left by 11101000100111100at 16 bits, wrapping
Shifted left by 11101000100111100= 53,564, no wrap
Shifted right by 111010001001111= 13,391, discarding the low bit
These bits as a double1.32320661 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime26,783+1
Previous prime26,777−5
Distance to nearest prime1
Nearest square below26,569
Nearest square above26,896

Powers & multiples

26,782 to the power 2717,275,524
26,782 to the power 319,210,073,083,768
26,782 to the power 4514,484,177,329,474,576
26,782 to the power 513,778,915,237,237,988,094,432
First ten multiples26,782, 53,564, 80,346, 107,128, 133,910, 160,692, 187,474, 214,256, 241,038, 267,820
Powers of twoBetween 2^14 (16,384) and 2^15 (32,768)

Divisibility tests

Divisible by 2Yes
Divisible by 3No, remainder 1
Divisible by 4No, remainder 2
Divisible by 5No, remainder 2
Divisible by 6No, remainder 4
Divisible by 7Yes
Divisible by 8No, remainder 6
Divisible by 9No, remainder 7
Divisible by 10No, remainder 2
Divisible by 11No, remainder 8
Divisible by 12No, remainder 10
Divisible by 100No, remainder 82

Collatz (3n + 1) trajectory

Steps to reach 146the total stopping time
Highest value reached135,5925× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps26,782 → 13,391 → 40,174 → 20,087 → 60,262 → 30,131 → 90,394 → 45,197 → 135,592 → 67,796 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage2,678,200%
26,782% as a decimal267.82
26,782% of 10026,782
26,782% of 1,000267,820
As a fraction of 10026,782/100

Read another way

As bytes26.154 KiB
As a 24-bit colour#00689E

Keep nerding

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

Nerdulate something else

Nothing in mind? Surprise me · today’s page

Every value on this page was computed from “26782” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.