Recognised as Number

26,922

Positive
Even
Composite
5 digits

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

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value26,922

Digit count5

Digit sum21

Digit product432

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

Digital root3repeated digit sum

PalindromicNoreads differently backwards

Happy numberYessquared-digit sums reach 1

Harshad numberYesdivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 3 × 7 × 641

Distinct prime factors42, 3, 7, 641

Number of divisors16

Sum of divisors σ(n)61,632

Aliquot sum34,710sum of the proper divisors

ClassificationAbundantthe aliquot sum exceeds the number

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

Carmichael function λ(n)1,920the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 7,680

Möbius function μ(n)+14 distinct prime factors, an even number of them

SquarefreeYesno repeated prime factor

All divisors1, 2, 3, 6, 7, 14, 21, 42, 641, 1,282, 1,923, 3,846, 4,487, 8,974, 13,461, 26,92216 in total

Arithmetic

Previous number26,921

Next number26,923

Double53,844

Half13,461

Square724,794,084

Cube19,512,906,329,448

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

Cube root29.971083247≈

Negation-26,922

Reciprocal0.0000371443≈

Representations

Decimal26,922

Binary11010010010101015 bits

Octal64452

Hexadecimal692A

Base 36KRU

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

In wordstwenty-six thousand, nine hundred and twenty-two

Ordinaltwenty-six thousand, nine hundred and twenty-second

Scientific notation2.6922 × 10^4

Engineering notation26.922 × 10^3

In other bases

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

Quinary1330142base 5; one hand: 7 digits

Septenary141330base 7: 6 digits

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

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

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

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

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

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

Bit-level

0110100100101010

Bit length15 bitsto write the magnitude

Set bits7the population count, or Hamming weight

Zero bits8within that length

Bit parityodd7 set bits, so odd; not the same as the number itself being even

Highest set bitbit 14worth 16,384

Lowest set bitbit 11 trailing zero

Power of twoNo

Bytes269 2a

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

At each machine width

16-bit0110100100101010

32-bit00000000000000000110100100101010

64-bit0000000000000000000000000000000000000000000000000110100100101010

One's complement1001011011010101at 16 bits, every bit flipped

Bits reversed0101010010010110at 16 bits

Rotated left by 11101001001010100at 16 bits, wrapping

Shifted left by 11101001001010100= 53,844, no wrap

Shifted right by 111010010010101= 13,461, discarding the low bit

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

Nearest landmarks

Next prime26,927+5

Previous prime26,921−1

Distance to nearest prime1

Nearest square below26,896

Nearest square above27,225

Powers & multiples

26,922 to the power 2724,794,084

26,922 to the power 319,512,906,329,448

26,922 to the power 4525,326,464,201,399,056

26,922 to the power 514,142,839,069,230,065,385,632

First ten multiples26,922, 53,844, 80,766, 107,688, 134,610, 161,532, 188,454, 215,376, 242,298, 269,220

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 2

Divisible by 6Yes

Divisible by 7Yes

Divisible by 8No, remainder 2

Divisible by 9No, remainder 3

Divisible by 10No, remainder 2

Divisible by 11No, remainder 5

Divisible by 12No, remainder 6

Divisible by 100No, remainder 22

Collatz (3n + 1) trajectory

Steps to reach 146the total stopping time

Highest value reached40,3841× the starting value

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

First steps26,922 → 13,461 → 40,384 → 20,192 → 10,096 → 5,048 → 2,524 → 1,262 → 631 → 1,894 → …

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

As a percentage & fraction

As a percentage2,692,200%

26,922% as a decimal269.22

26,922% of 10026,922

26,922% of 1,000269,220

As a fraction of 10026,922/100

Read another way

As seconds7 hours, 28 minutes and 42 seconds

As bytes26.291 KiB

As a 24-bit colour#00692A

Keep nerding

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