Recognised as Number

11,102

Positive
Even
Composite
5 digits

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

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value11,102

Digit count5

Digit sum5

Digit product0zero, because one of the digits is zero

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

Digital root5repeated digit sum

PalindromicNoreads differently backwards

Happy numberYessquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 7 × 13 × 61

Distinct prime factors42, 7, 13, 61

Number of divisors16

Sum of divisors σ(n)20,832

Aliquot sum9,730sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

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

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

SquarefreeYesno repeated prime factor

All divisors1, 2, 7, 13, 14, 26, 61, 91, 122, 182, 427, 793, 854, 1,586, 5,551, 11,10216 in total

Arithmetic

Previous number11,101

Next number11,103

Double22,204

Half5,551

Square123,254,404

Cube1,368,370,393,208

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

Cube root22.308330724≈

Negation-11,102

Reciprocal0.0000900739≈

Representations

Decimal11,102

Binary1010110101111014 bits

Octal25536

Hexadecimal2B5E

Base 368KE

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

In wordseleven thousand, one hundred and two

Ordinaleleven thousand, one hundred and second

Scientific notation1.1102 × 10^4

Engineering notation11.102 × 10^3

In other bases

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

Quinary323402base 5; one hand: 6 digits

Septenary44240base 7: 5 digits

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

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

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

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

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

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

Bit-level

0010101101011110

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 even

Highest set bitbit 13worth 8,192

Lowest set bitbit 11 trailing zero

Power of twoNo

Bytes22b 5e

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

At each machine width

16-bit0010101101011110

32-bit00000000000000000010101101011110

64-bit0000000000000000000000000000000000000000000000000010101101011110

One's complement1101010010100001at 16 bits, every bit flipped

Bits reversed0111101011010100at 16 bits

Rotated left by 10101011010111100at 16 bits, wrapping

Shifted left by 1101011010111100= 22,204, no wrap

Shifted right by 11010110101111= 5,551, discarding the low bit

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

Nearest landmarks

Next prime11,113+11

Previous prime11,093−9

Distance to nearest prime9

Nearest square below11,025

Nearest square above11,236

Powers & multiples

11,102 to the power 2123,254,404

11,102 to the power 31,368,370,393,208

11,102 to the power 415,191,648,105,395,216

11,102 to the power 5168,657,677,266,097,688,032

First ten multiples11,102, 22,204, 33,306, 44,408, 55,510, 66,612, 77,714, 88,816, 99,918, 111,020

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

Divisibility tests

Divisible by 2Yes

Divisible by 3No, remainder 2

Divisible by 4No, remainder 2

Divisible by 5No, remainder 2

Divisible by 6No, remainder 2

Divisible by 7Yes

Divisible by 8No, remainder 6

Divisible by 9No, remainder 5

Divisible by 10No, remainder 2

Divisible by 11No, remainder 3

Divisible by 12No, remainder 2

Divisible by 100No, remainder 2

Collatz (3n + 1) trajectory

Steps to reach 168the total stopping time

Highest value reached56,2125× the starting value

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

First steps11,102 → 5,551 → 16,654 → 8,327 → 24,982 → 12,491 → 37,474 → 18,737 → 56,212 → 28,106 → …

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

As a percentage & fraction

As a percentage1,110,200%

11,102% as a decimal111.02

11,102% of 10011,102

11,102% of 1,000111,020

As a fraction of 10011,102/100

Read another way

As seconds3 hours, 5 minutes and 2 seconds

As bytes10.842 KiB

As a 24-bit colour#002B5E

Keep nerding

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