Recognised as Number

11,101

Positive
Odd
Composite
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value11,101

Digit count5

Digit sum4

Digit product0zero, because one of the digits is zero

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

Digital root4repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation17 × 653

Distinct prime factors217, 653

Number of divisors4

Sum of divisors σ(n)11,772

Aliquot sum671sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

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

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

SquarefreeYesno repeated prime factor

All divisors1, 17, 653, 11,1014 in total

Arithmetic

Previous number11,100

Next number11,102

Double22,202

Half5,550.5

Square123,232,201

Cube1,368,000,663,301

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

Cube root22.307660904≈

Negation-11,101

Reciprocal0.000090082≈

Representations

Decimal11,101

Binary1010110101110114 bits

Octal25535

Hexadecimal2B5D

Base 368KD

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

In wordseleven thousand, one hundred and one

Ordinaleleven thousand, one hundred and first

Scientific notation1.1101 × 10^4

Engineering notation11.101 × 10^3

In other bases

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

Quinary323401base 5; one hand: 6 digits

Septenary44236base 7: 5 digits

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

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

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

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

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

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

Bit-level

0010101101011101

Bit length14 bitsto write the magnitude

Set bits9the population count, or Hamming weight

Zero bits5within that length

Bit parityodd9 set bits, so odd; 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 5d

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

At each machine width

16-bit0010101101011101

32-bit00000000000000000010101101011101

64-bit0000000000000000000000000000000000000000000000000010101101011101

One's complement1101010010100010at 16 bits, every bit flipped

Bits reversed1011101011010100at 16 bits

Rotated left by 10101011010111010at 16 bits, wrapping

Shifted left by 1101011010111010= 22,202, no wrap

Shifted right by 11010110101110= 5,550, discarding the low bit

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

Nearest landmarks

Next prime11,113+12

Previous prime11,093−8

Distance to nearest prime8

Nearest square below11,025

Nearest square above11,236

Powers & multiples

11,101 to the power 2123,232,201

11,101 to the power 31,368,000,663,301

11,101 to the power 415,186,175,363,304,401

11,101 to the power 5168,581,732,708,042,155,501

First ten multiples11,101, 22,202, 33,303, 44,404, 55,505, 66,606, 77,707, 88,808, 99,909, 111,010

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 1

Divisible by 5No, remainder 1

Divisible by 6No, remainder 1

Divisible by 7No, remainder 6

Divisible by 8No, remainder 5

Divisible by 9No, remainder 4

Divisible by 10No, remainder 1

Divisible by 11No, remainder 2

Divisible by 12No, remainder 1

Divisible by 100No, remainder 1

Collatz (3n + 1) trajectory

Steps to reach 168the total stopping time

Highest value reached33,3043× the starting value

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

First steps11,101 → 33,304 → 16,652 → 8,326 → 4,163 → 12,490 → 6,245 → 18,736 → 9,368 → 4,684 → …

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

As a percentage & fraction

As a percentage1,110,100%

11,101% as a decimal111.01

11,101% of 10011,101

11,101% of 1,000111,010

As a fraction of 10011,101/100

Read another way

As seconds3 hours, 5 minutes and 1 second

As bytes10.841 KiB

As a 24-bit colour#002B5D

Keep nerding

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