Recognised as Number

10,793

Positive
Odd
Composite
5 digits

10,793 is an odd 5-digit integer and a composite number. It has 4 divisors and a digital root of 2.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value10,793

Digit count5

Digit sum20

Digit product0zero, because one of the digits is zero

Multiplicative persistence1times 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 factorisation43 × 251

Distinct prime factors243, 251

Number of divisors4

Sum of divisors σ(n)11,088

Aliquot sum295sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

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

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

SquarefreeYesno repeated prime factor

All divisors1, 43, 251, 10,7934 in total

Arithmetic

Previous number10,792

Next number10,794

Double21,586

Half5,396.5

Square116,488,849

Cube1,257,264,147,257

Square root103.889364229≈irrational, shown to 9 decimal places

Cube root22.099412363≈

Negation-10,793

Reciprocal0.0000926526≈

Representations

Decimal10,793

Binary1010100010100114 bits

Octal25051

Hexadecimal2A29

Base 368BT

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

In wordsten thousand, seven hundred and ninety-three

Ordinalten thousand, seven hundred and ninety-third

Scientific notation1.0793 × 10^4

Engineering notation10.793 × 10^3

In other bases

Ternary112210202base 3; the most digit-efficient integer base after e: 9 digits

Quinary321133base 5; one hand: 6 digits

Septenary43316base 7: 5 digits

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

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

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

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

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

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

Bit-level

0010101000101001

Bit length14 bitsto write the magnitude

Set bits6the population count, or Hamming weight

Zero bits8within that length

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

Highest set bitbit 13worth 8,192

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes22a 29

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

At each machine width

16-bit0010101000101001

32-bit00000000000000000010101000101001

64-bit0000000000000000000000000000000000000000000000000010101000101001

One's complement1101010111010110at 16 bits, every bit flipped

Bits reversed1001010001010100at 16 bits

Rotated left by 10101010001010010at 16 bits, wrapping

Shifted left by 1101010001010010= 21,586, no wrap

Shifted right by 11010100010100= 5,396, discarding the low bit

These bits as a double5.33245052 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime10,799+6

Previous prime10,789−4

Distance to nearest prime4

Nearest square below10,609

Nearest square above10,816

Powers & multiples

10,793 to the power 2116,488,849

10,793 to the power 31,257,264,147,257

10,793 to the power 413,569,651,941,344,801

10,793 to the power 5146,457,253,402,934,437,193

First ten multiples10,793, 21,586, 32,379, 43,172, 53,965, 64,758, 75,551, 86,344, 97,137, 107,930

Powers of twoBetween 2^13 (8,192) and 2^14 (16,384)

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 2

Divisible by 4No, remainder 1

Divisible by 5No, remainder 3

Divisible by 6No, remainder 5

Divisible by 7No, remainder 6

Divisible by 8No, remainder 1

Divisible by 9No, remainder 2

Divisible by 10No, remainder 3

Divisible by 11No, remainder 2

Divisible by 12No, remainder 5

Divisible by 100No, remainder 93

Collatz (3n + 1) trajectory

Steps to reach 1117the total stopping time

Highest value reached599,05655× the starting value

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

First steps10,793 → 32,380 → 16,190 → 8,095 → 24,286 → 12,143 → 36,430 → 18,215 → 54,646 → 27,323 → …

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

As a percentage & fraction

As a percentage1,079,300%

10,793% as a decimal107.93

10,793% of 10010,793

10,793% of 1,000107,930

As a fraction of 10010,793/100

Read another way

As seconds2 hours, 59 minutes and 53 seconds

As bytes10.54 KiB

As a 24-bit colour#002A29

Keep nerding

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