Nerdulator> put something in

Recognised as Number

12,183

  • Positive
  • Odd
  • Composite
  • 5 digits

12,183 is an odd 5-digit integer and a composite number. It has 8 divisors and a digital root of 6.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value12,183
Digit count5
Digit sum15
Digit product48
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root6repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3 × 31 × 131
Distinct prime factors33, 31, 131
Number of divisors8
Sum of divisors σ(n)16,896
Aliquot sum4,713sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)7,800integers below n that share no factor with it
Carmichael function λ(n)390the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 7,800
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 3, 31, 93, 131, 393, 4,061, 12,1838 in total

Arithmetic

Previous number12,182
Next number12,184
Double24,366
Square root110.376627961≈irrational, shown to 9 decimal places
Cube root23.010077499≈
Negation-12,183
Reciprocal0.0000820816≈

Representations

Decimal12,183
Binary1011111001011114 bits
Octal27627
Hexadecimal2F97
Base 369EF
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwelve thousand, one hundred and eighty-three
Ordinaltwelve thousand, one hundred and eighty-third
Scientific notation1.2183 × 10^4
Engineering notation12.183 × 10^3

In other bases

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

Bit-level

0010111110010111
Bit length14 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits4within that length
Bit parityeven10 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
Bytes22f 97
Gray code11100001011100n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit0010111110010111
32-bit00000000000000000010111110010111
64-bit0000000000000000000000000000000000000000000000000010111110010111
One's complement1101000001101000at 16 bits, every bit flipped
Bits reversed1110100111110100at 16 bits
Rotated left by 10101111100101110at 16 bits, wrapping
Shifted left by 1101111100101110= 24,366, no wrap
Shifted right by 11011111001011= 6,091, discarding the low bit
These bits as a double6.01920176 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime12,197+14
Previous prime12,163−20
Distance to nearest prime14
Nearest square below12,100
Nearest square above12,321

Powers & multiples

12,183 to the power 2148,425,489
12,183 to the power 31,808,267,732,487
12,183 to the power 422,030,125,784,889,121
12,183 to the power 5268,393,022,437,304,161,143
First ten multiples12,183, 24,366, 36,549, 48,732, 60,915, 73,098, 85,281, 97,464, 109,647, 121,830
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 3
Divisible by 6No, remainder 3
Divisible by 7No, remainder 3
Divisible by 8No, remainder 7
Divisible by 9No, remainder 6
Divisible by 10No, remainder 3
Divisible by 11No, remainder 6
Divisible by 12No, remainder 3
Divisible by 100No, remainder 83

Collatz (3n + 1) trajectory

Steps to reach 137the total stopping time
Highest value reached82,2406× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps12,183 → 36,550 → 18,275 → 54,826 → 27,413 → 82,240 → 41,120 → 20,560 → 10,280 → 5,140 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage1,218,300%
12,183% as a decimal121.83
12,183% of 10012,183
12,183% of 1,000121,830
As a fraction of 10012,183/100

Read another way

As bytes11.897 KiB
As a 24-bit colour#002F97

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