Nerdulator> put something in

Recognised as Number

13,611

  • Positive
  • Odd
  • Composite
  • 5 digits

13,611 is an odd 5-digit integer and a composite number. It has 8 divisors and a digital root of 3.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value13,611
Digit count5
Digit sum12
Digit product18
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root3repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3 × 13 × 349
Distinct prime factors33, 13, 349
Number of divisors8
Sum of divisors σ(n)19,600
Aliquot sum5,989sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)8,352integers below n that share no factor with it
Carmichael function λ(n)348the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 8,352
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 3, 13, 39, 349, 1,047, 4,537, 13,6118 in total

Arithmetic

Previous number13,610
Next number13,612
Double27,222
Square root116.666190475≈irrational, shown to 9 decimal places
Cube root23.876097553≈
Negation-13,611
Reciprocal0.00007347≈

Representations

Decimal13,611
Binary1101010010101114 bits
Octal32453
Hexadecimal352B
Base 36AI3
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthirteen thousand, six hundred and eleven
Ordinalthirteen thousand, six hundred and eleventh
Scientific notation1.3611 × 10^4
Engineering notation13.611 × 10^3

In other bases

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

Bit-level

0011010100101011
Bit length14 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits6within that length
Bit parityeven8 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
Bytes235 2b
Gray code10111110111110n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit0011010100101011
32-bit00000000000000000011010100101011
64-bit0000000000000000000000000000000000000000000000000011010100101011
One's complement1100101011010100at 16 bits, every bit flipped
Bits reversed1101010010101100at 16 bits
Rotated left by 10110101001010110at 16 bits, wrapping
Shifted left by 1110101001010110= 27,222, no wrap
Shifted right by 11101010010101= 6,805, discarding the low bit
These bits as a double6.72472751 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime13,613+2
Previous prime13,597−14
Distance to nearest prime2
Nearest square below13,456
Nearest square above13,689

Powers & multiples

13,611 to the power 2185,259,321
13,611 to the power 32,521,564,618,131
13,611 to the power 434,321,016,017,381,041
13,611 to the power 5467,143,349,012,573,349,051
First ten multiples13,611, 27,222, 40,833, 54,444, 68,055, 81,666, 95,277, 108,888, 122,499, 136,110
Powers of twoBetween 2^13 (8,192) and 2^14 (16,384)

Divisibility tests

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

Collatz (3n + 1) trajectory

Steps to reach 189the total stopping time
Highest value reached61,2524× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps13,611 → 40,834 → 20,417 → 61,252 → 30,626 → 15,313 → 45,940 → 22,970 → 11,485 → 34,456 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage1,361,100%
13,611% as a decimal136.11
13,611% of 10013,611
13,611% of 1,000136,110
As a fraction of 10013,611/100

Read another way

As bytes13.292 KiB
As a 24-bit colour#00352B

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 “13611” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.