Recognised as Number

14,143

Positive
Odd
Prime
5 digits

14,143 is an odd 5-digit integer and a prime number. It has 2 divisors and a digital root of 4.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value14,143

Digit count5

Digit sum13

Digit product48

Multiplicative persistence3times the digit product can be taken before one digit is left

Digital root4repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation14,143

Distinct prime factors114,143

Number of divisors2

Sum of divisors σ(n)14,144

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)14,142the smallest exponent with aˣ ≡ 1 for every unit coprime to n

Möbius function μ(n)−11 distinct prime factor, an odd number of them

SquarefreeYesno repeated prime factor

All divisors1, 14,1432 in total

Arithmetic

Previous number14,142

Next number14,144

Double28,286

Half7,071.5

Square200,024,449

Cube2,828,945,782,207

Square root118.924345699≈irrational, shown to 9 decimal places

Cube root24.183204429≈

Negation-14,143

Reciprocal0.0000707064≈

Representations

Decimal14,143

Binary1101110011111114 bits

Octal33477

Hexadecimal373F

Base 36AWV

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

In wordsfourteen thousand, one hundred and forty-three

Ordinalfourteen thousand, one hundred and forty-third

Scientific notation1.4143 × 10^4

Engineering notation14.143 × 10^3

In other bases

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

Quinary423033base 5; one hand: 6 digits

Septenary56143base 7: 5 digits

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

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

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

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

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

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

Bit-level

0011011100111111

Bit length14 bitsto write the magnitude

Set bits11the population count, or Hamming weight

Zero bits3within that length

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

Highest set bitbit 13worth 8,192

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes237 3f

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

At each machine width

16-bit0011011100111111

32-bit00000000000000000011011100111111

64-bit0000000000000000000000000000000000000000000000000011011100111111

One's complement1100100011000000at 16 bits, every bit flipped

Bits reversed1111110011101100at 16 bits

Rotated left by 10110111001111110at 16 bits, wrapping

Shifted left by 1110111001111110= 28,286, no wrap

Shifted right by 11101110011111= 7,071, discarding the low bit

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

Nearest landmarks

Next prime14,149+6

Previous prime14,107−36

Distance to nearest prime0, it is prime

Nearest square below13,924

Nearest square above14,161

Powers & multiples

14,143 to the power 2200,024,449

14,143 to the power 32,828,945,782,207

14,143 to the power 440,009,780,197,753,601

14,143 to the power 5565,858,321,336,829,178,943

First ten multiples14,143, 28,286, 42,429, 56,572, 70,715, 84,858, 99,001, 113,144, 127,287, 141,430

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

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 1

Divisible by 4No, remainder 3

Divisible by 5No, remainder 3

Divisible by 6No, remainder 1

Divisible by 7No, remainder 3

Divisible by 8No, remainder 7

Divisible by 9No, remainder 4

Divisible by 10No, remainder 3

Divisible by 11No, remainder 8

Divisible by 12No, remainder 7

Divisible by 100No, remainder 43

Collatz (3n + 1) trajectory

Steps to reach 158the total stopping time

Highest value reached322,21622× the starting value

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

First steps14,143 → 42,430 → 21,215 → 63,646 → 31,823 → 95,470 → 47,735 → 143,206 → 71,603 → 214,810 → …

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

As a percentage & fraction

As a percentage1,414,300%

14,143% as a decimal141.43

14,143% of 10014,143

14,143% of 1,000141,430

As a fraction of 10014,143/100

Read another way

As seconds3 hours, 55 minutes and 43 seconds

As bytes13.812 KiB

As a 24-bit colour#00373F

Keep nerding

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