Recognised as Number

12,068

Positive
Even
Composite
5 digits

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

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value12,068

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 × 7 × 431

Distinct prime factors32, 7, 431

Number of divisors12

Sum of divisors σ(n)24,192

Aliquot sum12,124sum of the proper divisors

ClassificationAbundantthe aliquot sum exceeds the number

Euler's totient φ(n)5,160integers below n that share no factor with it

Carmichael function λ(n)1,290the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 5,160

Möbius function μ(n)0zero, because a prime divides n twice

SquarefreeNohas a repeated prime factor

All divisors1, 2, 4, 7, 14, 28, 431, 862, 1,724, 3,017, 6,034, 12,06812 in total

Arithmetic

Previous number12,067

Next number12,069

Double24,136

Half6,034

Square145,636,624

Cube1,757,542,778,432

Square root109.854449159≈irrational, shown to 9 decimal places

Cube root22.937448183≈

Negation-12,068

Reciprocal0.0000828638≈

Representations

Decimal12,068

Binary1011110010010014 bits

Octal27444

Hexadecimal2F24

Base 369B8

Roman numeralNot defined above 3,999there is no agreed standard notation

In wordstwelve thousand and sixty-eight

Ordinaltwelve thousand and sixty-eighth

Scientific notation1.2068 × 10^4

Engineering notation12.068 × 10^3

In other bases

Ternary121112222base 3; the most digit-efficient integer base after e: 9 digits

Quinary341233base 5; one hand: 6 digits

Septenary50120base 7: 5 digits

Nonary17488base 9; each digit is two ternary digits: 5 digits

Duodecimal6b98base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits

Vigesimal1a38base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits

Sexagesimal3:21:8base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

Balanced ternary1T0TTT000Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed

Negabinary111001101100100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

0010111100100100

Bit length14 bitsto write the magnitude

Set bits7the population count, or Hamming weight

Zero bits7within that length

Bit parityodd7 set bits, so odd; not the same as the number itself being even

Highest set bitbit 13worth 8,192

Lowest set bitbit 22 trailing zeros

Power of twoNo

Bytes22f 24

Gray code11100010110110n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit0010111100100100

32-bit00000000000000000010111100100100

64-bit0000000000000000000000000000000000000000000000000010111100100100

One's complement1101000011011011at 16 bits, every bit flipped

Bits reversed0010010011110100at 16 bits

Rotated left by 10101111001001000at 16 bits, wrapping

Shifted left by 1101111001001000= 24,136, no wrap

Shifted right by 11011110010010= 6,034, discarding the low bit

These bits as a double5.96238421 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime12,071+3

Previous prime12,049−19

Distance to nearest prime3

Nearest square below11,881

Nearest square above12,100

Powers & multiples

12,068 to the power 2145,636,624

12,068 to the power 31,757,542,778,432

12,068 to the power 421,210,026,250,117,376

12,068 to the power 5255,962,596,786,416,493,568

First ten multiples12,068, 24,136, 36,204, 48,272, 60,340, 72,408, 84,476, 96,544, 108,612, 120,680

Powers of twoBetween 2^13 (8,192) and 2^14 (16,384)

Divisibility tests

Divisible by 2Yes

Divisible by 3No, remainder 2

Divisible by 4Yes

Divisible by 5No, remainder 3

Divisible by 6No, remainder 2

Divisible by 7Yes

Divisible by 8No, remainder 4

Divisible by 9No, remainder 8

Divisible by 10No, remainder 8

Divisible by 11No, remainder 1

Divisible by 12No, remainder 8

Divisible by 100No, remainder 68

Collatz (3n + 1) trajectory

Steps to reach 142the total stopping time

Highest value reached15,2801× the starting value

Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven

First steps12,068 → 6,034 → 3,017 → 9,052 → 4,526 → 2,263 → 6,790 → 3,395 → 10,186 → 5,093 → …

Last steps… → 32 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage1,206,800%

12,068% as a decimal120.68

12,068% of 10012,068

12,068% of 1,000120,680

As a fraction of 10012,068/100

Read another way

As seconds3 hours, 21 minutes and 8 seconds

As bytes11.785 KiB

As a 24-bit colour#002F24

Keep nerding

Every link below is a page Nerdulator can generate from what it already knows about this value.