Nerdulator> put something in

Recognised as Number

13,661

  • Positive
  • Odd
  • Composite
  • 5 digits

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

Number properties

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

Factors & divisors

Prime factorisation19 × 719
Distinct prime factors219, 719
Number of divisors4
Sum of divisors σ(n)14,400
Aliquot sum739sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)12,924integers below n that share no factor with it
Carmichael function λ(n)6,462the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 12,924
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 19, 719, 13,6614 in total

Arithmetic

Previous number13,660
Next number13,662
Double27,322
Square root116.880280629≈irrational, shown to 9 decimal places
Cube root23.905298102≈
Negation-13,661
Reciprocal0.0000732011≈

Representations

Decimal13,661
Binary1101010101110114 bits
Octal32535
Hexadecimal355D
Base 36AJH
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthirteen thousand, six hundred and sixty-one
Ordinalthirteen thousand, six hundred and sixty-first
Scientific notation1.3661 × 10^4
Engineering notation13.661 × 10^3

In other bases

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

Bit-level

0011010101011101
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
Bytes235 5d
Gray code10111111110011n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit0011010101011101
32-bit00000000000000000011010101011101
64-bit0000000000000000000000000000000000000000000000000011010101011101
One's complement1100101010100010at 16 bits, every bit flipped
Bits reversed1011101010101100at 16 bits
Rotated left by 10110101010111010at 16 bits, wrapping
Shifted left by 1110101010111010= 27,322, no wrap
Shifted right by 11101010101110= 6,830, discarding the low bit
These bits as a double6.74943079 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime13,669+8
Previous prime13,649−12
Distance to nearest prime8
Nearest square below13,456
Nearest square above13,689

Powers & multiples

13,661 to the power 2186,622,921
13,661 to the power 32,549,455,723,781
13,661 to the power 434,828,114,642,572,241
13,661 to the power 5475,786,874,132,179,384,301
First ten multiples13,661, 27,322, 40,983, 54,644, 68,305, 81,966, 95,627, 109,288, 122,949, 136,610
Powers of twoBetween 2^13 (8,192) and 2^14 (16,384)

Divisibility tests

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

Collatz (3n + 1) trajectory

Steps to reach 1151the total stopping time
Highest value reached40,9843× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps13,661 → 40,984 → 20,492 → 10,246 → 5,123 → 15,370 → 7,685 → 23,056 → 11,528 → 5,764 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage1,366,100%
13,661% as a decimal136.61
13,661% of 10013,661
13,661% of 1,000136,610
As a fraction of 10013,661/100

Read another way

As bytes13.341 KiB
As a 24-bit colour#00355D

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