Recognised as Number

11,216

Positive
Even
Composite
5 digits

11,216 is an even 5-digit integer and a composite number. It has 10 divisors and a digital root of 2.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value11,216

Digit count5

Digit sum11

Digit product12

Multiplicative persistence2times 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 factorisation2^4 × 701

Distinct prime factors22, 701

Number of divisors10

Sum of divisors σ(n)21,762

Aliquot sum10,546sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

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

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

SquarefreeNohas a repeated prime factor

All divisors1, 2, 4, 8, 16, 701, 1,402, 2,804, 5,608, 11,21610 in total

Arithmetic

Previous number11,215

Next number11,217

Double22,432

Half5,608

Square125,798,656

Cube1,410,957,725,696

Square root105.905618359≈irrational, shown to 9 decimal places

Cube root22.384427953≈

Negation-11,216

Reciprocal0.0000891583≈

Representations

Decimal11,216

Binary1010111101000014 bits

Octal25720

Hexadecimal2BD0

Base 368NK

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

In wordseleven thousand, two hundred and sixteen

Ordinaleleven thousand, two hundred and sixteenth

Scientific notation1.1216 × 10^4

Engineering notation11.216 × 10^3

In other bases

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

Quinary324331base 5; one hand: 6 digits

Septenary44462base 7: 5 digits

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

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

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

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

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

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

Bit-level

0010101111010000

Bit length14 bitsto write the magnitude

Set bits7the population count, or Hamming weight

Zero bits7within that length

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

Highest set bitbit 13worth 8,192

Lowest set bitbit 44 trailing zeros

Power of twoNo

Bytes22b d0

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

At each machine width

16-bit0010101111010000

32-bit00000000000000000010101111010000

64-bit0000000000000000000000000000000000000000000000000010101111010000

One's complement1101010000101111at 16 bits, every bit flipped

Bits reversed0000101111010100at 16 bits

Rotated left by 10101011110100000at 16 bits, wrapping

Shifted left by 1101011110100000= 22,432, no wrap

Shifted right by 11010111101000= 5,608, discarding the low bit

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

Nearest landmarks

Next prime11,239+23

Previous prime11,213−3

Distance to nearest prime3

Nearest square below11,025

Nearest square above11,236

Powers & multiples

11,216 to the power 2125,798,656

11,216 to the power 31,410,957,725,696

11,216 to the power 415,825,301,851,406,336

11,216 to the power 5177,496,585,565,373,464,576

First ten multiples11,216, 22,432, 33,648, 44,864, 56,080, 67,296, 78,512, 89,728, 100,944, 112,160

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

Divisibility tests

Divisible by 2Yes

Divisible by 3No, remainder 2

Divisible by 4Yes

Divisible by 5No, remainder 1

Divisible by 6No, remainder 2

Divisible by 7No, remainder 2

Divisible by 8Yes

Divisible by 9No, remainder 2

Divisible by 10No, remainder 6

Divisible by 11No, remainder 7

Divisible by 12No, remainder 8

Divisible by 100No, remainder 16

Collatz (3n + 1) trajectory

Steps to reach 186the total stopping time

Highest value reached11,216

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

First steps11,216 → 5,608 → 2,804 → 1,402 → 701 → 2,104 → 1,052 → 526 → 263 → 790 → …

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

As a percentage & fraction

As a percentage1,121,600%

11,216% as a decimal112.16

11,216% of 10011,216

11,216% of 1,000112,160

As a fraction of 10011,216/100

Read another way

As seconds3 hours, 6 minutes and 56 seconds

As bytes10.953 KiB

As a 24-bit colour#002BD0

Keep nerding

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