Recognised as Number

14,142

Positive
Even
Composite
5 digits

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

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value14,142

Digit count5

Digit sum12

Digit product32

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

Digital root3repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 3 × 2,357

Distinct prime factors32, 3, 2,357

Number of divisors8

Sum of divisors σ(n)28,296

Aliquot sum14,154sum of the proper divisors

ClassificationAbundantthe aliquot sum exceeds the number

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

Carmichael function λ(n)2,356the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 4,712

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

SquarefreeYesno repeated prime factor

All divisors1, 2, 3, 6, 2,357, 4,714, 7,071, 14,1428 in total

Arithmetic

Previous number14,141

Next number14,143

Double28,284

Half7,071

Square199,996,164

Cube2,828,345,751,288

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

Cube root24.182634447≈

Negation-14,142

Reciprocal0.0000707114≈

Representations

Decimal14,142

Binary1101110011111014 bits

Octal33476

Hexadecimal373E

Base 36AWU

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

In wordsfourteen thousand, one hundred and forty-two

Ordinalfourteen thousand, one hundred and forty-second

Scientific notation1.4142 × 10^4

Engineering notation14.142 × 10^3

In other bases

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

Quinary423032base 5; one hand: 6 digits

Septenary56142base 7: 5 digits

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

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

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

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

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

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

Bit-level

0011011100111110

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 even

Highest set bitbit 13worth 8,192

Lowest set bitbit 11 trailing zero

Power of twoNo

Bytes237 3e

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

At each machine width

16-bit0011011100111110

32-bit00000000000000000011011100111110

64-bit0000000000000000000000000000000000000000000000000011011100111110

One's complement1100100011000001at 16 bits, every bit flipped

Bits reversed0111110011101100at 16 bits

Rotated left by 10110111001111100at 16 bits, wrapping

Shifted left by 1110111001111100= 28,284, no wrap

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

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

Nearest landmarks

Next prime14,143+1

Previous prime14,107−35

Distance to nearest prime1

Nearest square below13,924

Nearest square above14,161

Powers & multiples

14,142 to the power 2199,996,164

14,142 to the power 32,828,345,751,288

14,142 to the power 439,998,465,614,714,896

14,142 to the power 5565,658,300,723,298,059,232

First ten multiples14,142, 28,284, 42,426, 56,568, 70,710, 84,852, 98,994, 113,136, 127,278, 141,420

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

Divisibility tests

Divisible by 2Yes

Divisible by 3Yes

Divisible by 4No, remainder 2

Divisible by 5No, remainder 2

Divisible by 6Yes

Divisible by 7No, remainder 2

Divisible by 8No, remainder 6

Divisible by 9No, remainder 3

Divisible by 10No, remainder 2

Divisible by 11No, remainder 7

Divisible by 12No, remainder 6

Divisible by 100No, remainder 42

Collatz (3n + 1) trajectory

Steps to reach 158the total stopping time

Highest value reached120,8328× the starting value

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

First steps14,142 → 7,071 → 21,214 → 10,607 → 31,822 → 15,911 → 47,734 → 23,867 → 71,602 → 35,801 → …

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

As a percentage & fraction

As a percentage1,414,200%

14,142% as a decimal141.42

14,142% of 10014,142

14,142% of 1,000141,420

As a fraction of 10014,142/100

Read another way

As seconds3 hours, 55 minutes and 42 seconds

As bytes13.811 KiB

As a 24-bit colour#00373E

Keep nerding

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