Nerdulator> put something in

Recognised as Number

26,921

  • Positive
  • Odd
  • Prime
  • 5 digits

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

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value26,921
Digit count5
Digit sum20
Digit product216
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 factorisation26,921
Distinct prime factors126,921
Number of divisors2
Sum of divisors σ(n)26,922
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)26,920integers below n that share no factor with it
Carmichael function λ(n)26,920the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)−11 distinct prime factor, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 26,9212 in total

Arithmetic

Previous number26,920
Next number26,922
Double53,842
Square root164.076201809≈irrational, shown to 9 decimal places
Cube root29.970712157≈
Negation-26,921
Reciprocal0.0000371457≈

Representations

Decimal26,921
Binary11010010010100115 bits
Octal64451
Hexadecimal6929
Base 36KRT
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwenty-six thousand, nine hundred and twenty-one
Ordinaltwenty-six thousand, nine hundred and twenty-first
Scientific notation2.6921 × 10^4
Engineering notation26.921 × 10^3

In other bases

Ternary1100221002base 3; the most digit-efficient integer base after e: 10 digits
Quinary1330141base 5; one hand: 7 digits
Septenary141326base 7: 6 digits
Nonary40832base 9; each digit is two ternary digits: 5 digits
Duodecimal136b5base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal3761base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal7:28:41base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary11010T101Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11011100101111001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

0110100100101001
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 odd
Highest set bitbit 14worth 16,384
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes269 29
Gray code101110110111101n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit0110100100101001
32-bit00000000000000000110100100101001
64-bit0000000000000000000000000000000000000000000000000110100100101001
One's complement1001011011010110at 16 bits, every bit flipped
Bits reversed1001010010010110at 16 bits
Rotated left by 11101001001010010at 16 bits, wrapping
Shifted left by 11101001001010010= 53,842, no wrap
Shifted right by 111010010010100= 13,460, discarding the low bit
These bits as a double1.33007413 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime26,927+6
Previous prime26,903−18
Distance to nearest prime0, it is prime
Nearest square below26,896
Nearest square above27,225

Powers & multiples

26,921 to the power 2724,740,241
26,921 to the power 319,510,732,027,961
26,921 to the power 4525,248,416,924,738,081
26,921 to the power 514,140,212,632,030,873,878,601
First ten multiples26,921, 53,842, 80,763, 107,684, 134,605, 161,526, 188,447, 215,368, 242,289, 269,210
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 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 6
Divisible by 8No, remainder 1
Divisible by 9No, remainder 2
Divisible by 10No, remainder 1
Divisible by 11No, remainder 4
Divisible by 12No, remainder 5
Divisible by 100No, remainder 21

Collatz (3n + 1) trajectory

Steps to reach 1152the total stopping time
Highest value reached560,35620× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps26,921 → 80,764 → 40,382 → 20,191 → 60,574 → 30,287 → 90,862 → 45,431 → 136,294 → 68,147 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage2,692,100%
26,921% as a decimal269.21
26,921% of 10026,921
26,921% of 1,000269,210
As a fraction of 10026,921/100

Read another way

As bytes26.29 KiB
As a 24-bit colour#006929

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 “26921” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.