Recognised as Number

10,960

Positive
Even
Composite
5 digits

10,960 is an even 5-digit integer and a composite number. It has 20 divisors and a digital root of 7.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value10,960

Digit count5

Digit sum16

Digit product0zero, because one of the digits is zero

Multiplicative persistence1times 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 numberYesdivisible by its own digit sum

Factors & divisors

Prime factorisation2^4 × 5 × 137

Distinct prime factors32, 5, 137

Number of divisors20

Sum of divisors σ(n)25,668

Aliquot sum14,708sum of the proper divisors

ClassificationAbundantthe aliquot sum exceeds the number

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

Carmichael function λ(n)136the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 4,352

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

SquarefreeNohas a repeated prime factor

All divisors1, 2, 4, 5, 8, 10, 16, 20, 40, 80, 137, 274, 548, 685, 1,096, 1,370, 2,192, 2,740, 5,480, 10,96020 in total

Arithmetic

Previous number10,959

Next number10,961

Double21,920

Half5,480

Square120,121,600

Cube1,316,532,736,000

Square root104.690018626≈irrational, shown to 9 decimal places

Cube root22.21281083≈

Negation-10,960

Reciprocal0.0000912409≈

Representations

Decimal10,960

Binary1010101101000014 bits

Octal25320

Hexadecimal2AD0

Base 368GG

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

In wordsten thousand, nine hundred and sixty

Ordinalten thousand, nine hundred and sixtieth

Scientific notation1.096 × 10^4

Engineering notation10.96 × 10^3

In other bases

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

Quinary322320base 5; one hand: 6 digits

Septenary43645base 7: 5 digits

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

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

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

Sexagesimal3:2:40base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

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

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

Bit-level

0010101011010000

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 even

Highest set bitbit 13worth 8,192

Lowest set bitbit 44 trailing zeros

Power of twoNo

Bytes22a d0

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

At each machine width

16-bit0010101011010000

32-bit00000000000000000010101011010000

64-bit0000000000000000000000000000000000000000000000000010101011010000

One's complement1101010100101111at 16 bits, every bit flipped

Bits reversed0000101101010100at 16 bits

Rotated left by 10101010110100000at 16 bits, wrapping

Shifted left by 1101010110100000= 21,920, no wrap

Shifted right by 11010101101000= 5,480, discarding the low bit

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

Nearest landmarks

Next prime10,973+13

Previous prime10,957−3

Distance to nearest prime3

Nearest square below10,816

Nearest square above11,025

Powers & multiples

10,960 to the power 2120,121,600

10,960 to the power 31,316,532,736,000

10,960 to the power 414,429,198,786,560,000

10,960 to the power 5158,144,018,700,697,600,000

First ten multiples10,960, 21,920, 32,880, 43,840, 54,800, 65,760, 76,720, 87,680, 98,640, 109,600

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

Divisibility tests

Divisible by 2Yes

Divisible by 3No, remainder 1

Divisible by 4Yes

Divisible by 5Yes

Divisible by 6No, remainder 4

Divisible by 7No, remainder 5

Divisible by 8Yes

Divisible by 9No, remainder 7

Divisible by 10Yes

Divisible by 11No, remainder 4

Divisible by 12No, remainder 4

Divisible by 100No, remainder 60

Collatz (3n + 1) trajectory

Steps to reach 1130the total stopping time

Highest value reached10,960

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

First steps10,960 → 5,480 → 2,740 → 1,370 → 685 → 2,056 → 1,028 → 514 → 257 → 772 → …

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

As a percentage & fraction

As a percentage1,096,000%

10,960% as a decimal109.6

10,960% of 10010,960

10,960% of 1,000109,600

As a fraction of 10010,960/100

Read another way

As seconds3 hours, 2 minutes and 40 seconds

As bytes10.703 KiB

As a 24-bit colour#002AD0

Keep nerding

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