Nerdulator> put something in

Recognised as Number

13,660

  • Positive
  • Even
  • Composite
  • 5 digits

13,660 is an even 5-digit integer and a composite number. It has 12 divisors and a digital root of 7.

Number properties

ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value13,660
Digit count5
Digit sum16
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2^2 × 5 × 683
Distinct prime factors32, 5, 683
Number of divisors12
Sum of divisors σ(n)28,728
Aliquot sum15,068sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)5,456integers below n that share no factor with it
Carmichael function λ(n)1,364the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 5,456
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 5, 10, 20, 683, 1,366, 2,732, 3,415, 6,830, 13,66012 in total

Arithmetic

Previous number13,659
Next number13,661
Double27,320
Half6,830
Square root116.876002669≈irrational, shown to 9 decimal places
Cube root23.90471479≈
Negation-13,660
Reciprocal0.0000732064≈

Representations

Decimal13,660
Binary1101010101110014 bits
Octal32534
Hexadecimal355C
Base 36AJG
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthirteen thousand, six hundred and sixty
Ordinalthirteen thousand, six hundred and sixtieth
Scientific notation1.366 × 10^4
Engineering notation13.66 × 10^3

In other bases

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

Bit-level

0011010101011100
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 even
Highest set bitbit 13worth 8,192
Lowest set bitbit 22 trailing zeros
Power of twoNo
Bytes235 5c
Gray code10111111110010n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit0011010101011100
32-bit00000000000000000011010101011100
64-bit0000000000000000000000000000000000000000000000000011010101011100
One's complement1100101010100011at 16 bits, every bit flipped
Bits reversed0011101010101100at 16 bits
Rotated left by 10110101010111000at 16 bits, wrapping
Shifted left by 1110101010111000= 27,320, no wrap
Shifted right by 11101010101110= 6,830, discarding the low bit
These bits as a double6.74893672 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime13,669+9
Previous prime13,649−11
Distance to nearest prime9
Nearest square below13,456
Nearest square above13,689

Powers & multiples

13,660 to the power 2186,595,600
13,660 to the power 32,548,895,896,000
13,660 to the power 434,817,917,939,360,000
13,660 to the power 5475,612,759,051,657,600,000
First ten multiples13,660, 27,320, 40,980, 54,640, 68,300, 81,960, 95,620, 109,280, 122,940, 136,600
Powers of twoBetween 2^13 (8,192) and 2^14 (16,384)

Divisibility tests

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

Collatz (3n + 1) trajectory

Steps to reach 1151the total stopping time
Highest value reached23,0561× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps13,660 → 6,830 → 3,415 → 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,000%
13,660% as a decimal136.6
13,660% of 10013,660
13,660% of 1,000136,600
As a fraction of 10013,660/100

Read another way

As bytes13.34 KiB
As a 24-bit colour#00355C

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