Recognised as Number
23,660
- Positive
- Even
- Composite
- 5 digits
23,660 is an even 5-digit integer and a composite number. It has 36 divisors and a digital root of 8.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value23,660
Digit count5
Digit sum17
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times 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 factorisation2^2 × 5 × 7 × 13^2
Distinct prime factors42, 5, 7, 13
Number of divisors36
Sum of divisors σ(n)61,488
Aliquot sum37,828sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)7,488integers below n that share no factor with it
Carmichael function λ(n)156the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 7,488
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 5, 7, 10, 13, 14, 20, 26, 28, 35, 52, 65, 70, 91, 130, 140, 169, 182, 260, 338, 364, 455, 676, 845, 910, 1,183, 1,690, 1,820, 2,366, 3,380, 4,732, 5,915, 11,830, 23,66036 in total
Arithmetic
Representations
Decimal23,660
Binary10111000110110015 bits
Octal56154
Hexadecimal5C6C
Base 36I98
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwenty-three thousand, six hundred and sixty
Ordinaltwenty-three thousand, six hundred and sixtieth
Scientific notation2.366 × 10^4
Engineering notation23.66 × 10^3
In other bases
Ternary1012110022base 3; the most digit-efficient integer base after e: 10 digits
Quinary1224120base 5; one hand: 7 digits
Septenary125660base 7: 6 digits
Nonary35408base 9; each digit is two ternary digits: 5 digits
Duodecimal11838base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal2j30base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal6:34:20base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary11TT11010Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11010110110111100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
0101110001101100
Bit length15 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits7within that length
Bit parityeven8 set bits, so even; not the same as the number itself being even
Highest set bitbit 14worth 16,384
Lowest set bitbit 22 trailing zeros
Power of twoNo
Bytes25c 6c
Gray code111001001011010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit0101110001101100
32-bit00000000000000000101110001101100
64-bit0000000000000000000000000000000000000000000000000101110001101100
One's complement1010001110010011at 16 bits, every bit flipped
Bits reversed0011011000111010at 16 bits
Rotated left by 11011100011011000at 16 bits, wrapping
Shifted left by 11011100011011000= 47,320, no wrap
Shifted right by 110111000110110= 11,830, discarding the low bit
These bits as a double1.16895932 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
23,660 to the power 2559,795,600
23,660 to the power 313,244,763,896,000
23,660 to the power 4313,371,113,779,360,000
23,660 to the power 57,414,360,552,019,657,600,000
First ten multiples23,660, 47,320, 70,980, 94,640, 118,300, 141,960, 165,620, 189,280, 212,940, 236,600
Powers of twoBetween 2^14 (16,384) and 2^15 (32,768)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 2
Divisible by 4Yes
Divisible by 5Yes
Divisible by 6No, remainder 2
Divisible by 7Yes
Divisible by 8No, remainder 4
Divisible by 9No, remainder 8
Divisible by 10Yes
Divisible by 11No, remainder 10
Divisible by 12No, remainder 8
Divisible by 100No, remainder 60
Collatz (3n + 1) trajectory
Steps to reach 1175the total stopping time
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps23,660 → 11,830 → 5,915 → 17,746 → 8,873 → 26,620 → 13,310 → 6,655 → 19,966 → 9,983 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage2,366,000%
23,660% as a decimal236.6
23,660% of 10023,660
23,660% of 1,000236,600
As a fraction of 10023,660/100
Read another way
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from 23,660
Nerdulate something else
Nothing in mind? Surprise me · today’s page