Nerdulator> put something in

Recognised as Number

12,867

  • Positive
  • Odd
  • Composite
  • 5 digits

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

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value12,867
Digit count5
Digit sum24
Digit product672
Multiplicative persistence4times the digit product can be taken before one digit is left
Digital root6repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3 × 4,289
Distinct prime factors23, 4,289
Number of divisors4
Sum of divisors σ(n)17,160
Aliquot sum4,293sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)8,576integers below n that share no factor with it
Carmichael function λ(n)4,288the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 8,576
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 3, 4,289, 12,8674 in total

Arithmetic

Previous number12,866
Next number12,868
Double25,734
Square root113.432799489≈irrational, shown to 9 decimal places
Cube root23.432885314≈
Negation-12,867
Reciprocal0.0000777182≈

Representations

Decimal12,867
Binary1100100100001114 bits
Octal31103
Hexadecimal3243
Base 369XF
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwelve thousand, eight hundred and sixty-seven
Ordinaltwelve thousand, eight hundred and sixty-seventh
Scientific notation1.2867 × 10^4
Engineering notation12.867 × 10^3

In other bases

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

Bit-level

0011001001000011
Bit length14 bitsto write the magnitude
Set bits6the population count, or Hamming weight
Zero bits8within that length
Bit parityeven6 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
Bytes232 43
Gray code10101101100010n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit0011001001000011
32-bit00000000000000000011001001000011
64-bit0000000000000000000000000000000000000000000000000011001001000011
One's complement1100110110111100at 16 bits, every bit flipped
Bits reversed1100001001001100at 16 bits
Rotated left by 10110010010000110at 16 bits, wrapping
Shifted left by 1110010010000110= 25,734, no wrap
Shifted right by 11100100100001= 6,433, discarding the low bit
These bits as a double6.35714267 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime12,889+22
Previous prime12,853−14
Distance to nearest prime14
Nearest square below12,769
Nearest square above12,996

Powers & multiples

12,867 to the power 2165,559,689
12,867 to the power 32,130,256,518,363
12,867 to the power 427,410,010,621,776,721
12,867 to the power 5352,684,606,670,401,069,107
First ten multiples12,867, 25,734, 38,601, 51,468, 64,335, 77,202, 90,069, 102,936, 115,803, 128,670
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 2
Divisible by 6No, remainder 3
Divisible by 7No, remainder 1
Divisible by 8No, remainder 3
Divisible by 9No, remainder 6
Divisible by 10No, remainder 7
Divisible by 11No, remainder 8
Divisible by 12No, remainder 3
Divisible by 100No, remainder 67

Collatz (3n + 1) trajectory

Steps to reach 163the total stopping time
Highest value reached57,9044× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps12,867 → 38,602 → 19,301 → 57,904 → 28,952 → 14,476 → 7,238 → 3,619 → 10,858 → 5,429 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage1,286,700%
12,867% as a decimal128.67
12,867% of 10012,867
12,867% of 1,000128,670
As a fraction of 10012,867/100

Read another way

As bytes12.565 KiB
As a 24-bit colour#003243

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