Recognised as Number

26,362

Positive
Even
Composite
5 digits

26,362 is an even 5-digit integer and a composite number. It has 12 divisors and a digital root of 1.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value26,362

Digit count5

Digit sum19

Digit product432

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

Digital root1repeated digit sum

PalindromicYesreads the same backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 7^2 × 269

Distinct prime factors32, 7, 269

Number of divisors12

Sum of divisors σ(n)46,170

Aliquot sum19,808sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)5,628the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 11,256

Möbius function μ(n)0zero, because a prime divides n twice

SquarefreeNohas a repeated prime factor

All divisors1, 2, 7, 14, 49, 98, 269, 538, 1,883, 3,766, 13,181, 26,36212 in total

Arithmetic

Previous number26,361

Next number26,363

Double52,724

Half13,181

Square694,955,044

Cube18,320,404,869,928

Square root162.363789066≈irrational, shown to 9 decimal places

Cube root29.761817681≈

Negation-26,362

Reciprocal0.0000379334≈

Representations

Decimal26,362

Binary11001101111101015 bits

Octal63372

Hexadecimal66FA

Base 36KCA

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

In wordstwenty-six thousand, three hundred and sixty-two

Ordinaltwenty-six thousand, three hundred and sixty-second

Scientific notation2.6362 × 10^4

Engineering notation26.362 × 10^3

In other bases

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

Quinary1320422base 5; one hand: 7 digits

Septenary136600base 7: 6 digits

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

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

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

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

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

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

Bit-level

0110011011111010

Bit length15 bitsto write the magnitude

Set bits10the population count, or Hamming weight

Zero bits5within that length

Bit parityeven10 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

Bytes266 fa

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

At each machine width

16-bit0110011011111010

32-bit00000000000000000110011011111010

64-bit0000000000000000000000000000000000000000000000000110011011111010

One's complement1001100100000101at 16 bits, every bit flipped

Bits reversed0101111101100110at 16 bits

Rotated left by 11100110111110100at 16 bits, wrapping

Shifted left by 11100110111110100= 52,724, no wrap

Shifted right by 111001101111101= 13,181, discarding the low bit

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

Nearest landmarks

Next prime26,371+9

Previous prime26,357−5

Distance to nearest prime5

Nearest square below26,244

Nearest square above26,569

Powers & multiples

26,362 to the power 2694,955,044

26,362 to the power 318,320,404,869,928

26,362 to the power 4482,962,513,181,041,936

26,362 to the power 512,731,857,772,478,627,516,832

First ten multiples26,362, 52,724, 79,086, 105,448, 131,810, 158,172, 184,534, 210,896, 237,258, 263,620

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 2

Divisible by 9No, remainder 1

Divisible by 10No, remainder 2

Divisible by 11No, remainder 6

Divisible by 12No, remainder 10

Divisible by 100No, remainder 62

Collatz (3n + 1) trajectory

Steps to reach 1139the total stopping time

Highest value reached50,0561× the starting value

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

First steps26,362 → 13,181 → 39,544 → 19,772 → 9,886 → 4,943 → 14,830 → 7,415 → 22,246 → 11,123 → …

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

As a percentage & fraction

As a percentage2,636,200%

26,362% as a decimal263.62

26,362% of 10026,362

26,362% of 1,000263,620

As a fraction of 10026,362/100

Read another way

As seconds7 hours, 19 minutes and 22 seconds

As bytes25.744 KiB

As a 24-bit colour#0066FA

Keep nerding

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