Nerdulator> put something in

Recognised as Number

11,154

  • Positive
  • Even
  • Composite
  • 5 digits

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

Number properties

ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value11,154
Digit count5
Digit sum12
Digit product20
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root3repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 3 × 11 × 13^2
Distinct prime factors42, 3, 11, 13
Number of divisors24
Sum of divisors σ(n)26,352
Aliquot sum15,198sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)3,120integers below n that share no factor with it
Carmichael function λ(n)780the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 3,120
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 3, 6, 11, 13, 22, 26, 33, 39, 66, 78, 143, 169, 286, 338, 429, 507, 858, 1,014, 1,859, 3,718, 5,577, 11,15424 in total

Arithmetic

Previous number11,153
Next number11,155
Double22,308
Half5,577
Square root105.61249926≈irrational, shown to 9 decimal places
Cube root22.343106042≈
Negation-11,154
Reciprocal0.0000896539≈

Representations

Decimal11,154
Binary1010111001001014 bits
Octal25622
Hexadecimal2B92
Base 368LU
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordseleven thousand, one hundred and fifty-four
Ordinaleleven thousand, one hundred and fifty-fourth
Scientific notation1.1154 × 10^4
Engineering notation11.154 × 10^3

In other bases

Ternary120022010base 3; the most digit-efficient integer base after e: 9 digits
Quinary324104base 5; one hand: 6 digits
Septenary44343base 7: 5 digits
Nonary16263base 9; each digit is two ternary digits: 5 digits
Duodecimal6556base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits
Vigesimal17hebase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal3:5:54base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1TT010T010digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary111110010010110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

0010101110010010
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 11 trailing zero
Power of twoNo
Bytes22b 92
Gray code11111001011011n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit0010101110010010
32-bit00000000000000000010101110010010
64-bit0000000000000000000000000000000000000000000000000010101110010010
One's complement1101010001101101at 16 bits, every bit flipped
Bits reversed0100100111010100at 16 bits
Rotated left by 10101011100100100at 16 bits, wrapping
Shifted left by 1101011100100100= 22,308, no wrap
Shifted right by 11010111001001= 5,577, discarding the low bit
These bits as a double5.51080821 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime11,159+5
Previous prime11,149−5
Distance to nearest prime5
Nearest square below11,025
Nearest square above11,236

Powers & multiples

11,154 to the power 2124,411,716
11,154 to the power 31,387,688,280,264
11,154 to the power 415,478,275,078,064,656
11,154 to the power 5172,644,680,220,733,173,024
First ten multiples11,154, 22,308, 33,462, 44,616, 55,770, 66,924, 78,078, 89,232, 100,386, 111,540
Powers of twoBetween 2^13 (8,192) and 2^14 (16,384)

Divisibility tests

Divisible by 2Yes
Divisible by 3Yes
Divisible by 4No, remainder 2
Divisible by 5No, remainder 4
Divisible by 6Yes
Divisible by 7No, remainder 3
Divisible by 8No, remainder 2
Divisible by 9No, remainder 3
Divisible by 10No, remainder 4
Divisible by 11Yes
Divisible by 12No, remainder 6
Divisible by 100No, remainder 54

Collatz (3n + 1) trajectory

Steps to reach 142the total stopping time
Highest value reached28,2402× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps11,154 → 5,577 → 16,732 → 8,366 → 4,183 → 12,550 → 6,275 → 18,826 → 9,413 → 28,240 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage1,115,400%
11,154% as a decimal111.54
11,154% of 10011,154
11,154% of 1,000111,540
As a fraction of 10011,154/100

Read another way

As bytes10.893 KiB
As a 24-bit colour#002B92

Keep nerding

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

Nerdulate something else

Nothing in mind? Surprise me · today’s page

Every value on this page was computed from “11154” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.