Recognised as Number

11,215

Positive
Odd
Composite
5 digits

11,215 is an odd 5-digit integer and a composite number. It has 4 divisors and a digital root of 1.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value11,215

Digit count5

Digit sum10

Digit product10

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

Digital root1repeated digit sum

PalindromicNoreads differently backwards

Happy numberYessquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation5 × 2,243

Distinct prime factors25, 2,243

Number of divisors4

Sum of divisors σ(n)13,464

Aliquot sum2,249sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

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

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

SquarefreeYesno repeated prime factor

All divisors1, 5, 2,243, 11,2154 in total

Arithmetic

Previous number11,214

Next number11,216

Double22,430

Half5,607.5

Square125,776,225

Cube1,410,580,363,375

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

Cube root22.38376268≈

Negation-11,215

Reciprocal0.0000891663≈

Representations

Decimal11,215

Binary1010111100111114 bits

Octal25717

Hexadecimal2BCF

Base 368NJ

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

In wordseleven thousand, two hundred and fifteen

Ordinaleleven thousand, two hundred and fifteenth

Scientific notation1.1215 × 10^4

Engineering notation11.215 × 10^3

In other bases

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

Quinary324330base 5; one hand: 6 digits

Septenary44461base 7: 5 digits

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

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

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

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

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

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

Bit-level

0010101111001111

Bit length14 bitsto write the magnitude

Set bits10the population count, or Hamming weight

Zero bits4within that length

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

Bytes22b cf

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

At each machine width

16-bit0010101111001111

32-bit00000000000000000010101111001111

64-bit0000000000000000000000000000000000000000000000000010101111001111

One's complement1101010000110000at 16 bits, every bit flipped

Bits reversed1111001111010100at 16 bits

Rotated left by 10101011110011110at 16 bits, wrapping

Shifted left by 1101011110011110= 22,430, no wrap

Shifted right by 11010111100111= 5,607, discarding the low bit

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

Nearest landmarks

Next prime11,239+24

Previous prime11,213−2

Distance to nearest prime2

Nearest square below11,025

Nearest square above11,236

Powers & multiples

11,215 to the power 2125,776,225

11,215 to the power 31,410,580,363,375

11,215 to the power 415,819,658,775,250,625

11,215 to the power 5177,417,473,164,435,759,375

First ten multiples11,215, 22,430, 33,645, 44,860, 56,075, 67,290, 78,505, 89,720, 100,935, 112,150

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

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 1

Divisible by 4No, remainder 3

Divisible by 5Yes

Divisible by 6No, remainder 1

Divisible by 7No, remainder 1

Divisible by 8No, remainder 7

Divisible by 9No, remainder 1

Divisible by 10No, remainder 5

Divisible by 11No, remainder 6

Divisible by 12No, remainder 7

Divisible by 100No, remainder 15

Collatz (3n + 1) trajectory

Steps to reach 168the total stopping time

Highest value reached113,56010× the starting value

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

First steps11,215 → 33,646 → 16,823 → 50,470 → 25,235 → 75,706 → 37,853 → 113,560 → 56,780 → 28,390 → …

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

As a percentage & fraction

As a percentage1,121,500%

11,215% as a decimal112.15

11,215% of 10011,215

11,215% of 1,000112,150

As a fraction of 10011,215/100

Read another way

As seconds3 hours, 6 minutes and 55 seconds

As bytes10.952 KiB

As a 24-bit colour#002BCF

Keep nerding

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