Recognised as Number

14,141

Positive
Odd
Composite
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value14,141

Digit count5

Digit sum11

Digit product16

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

Digital root2repeated digit sum

PalindromicYesreads the same backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation79 × 179

Distinct prime factors279, 179

Number of divisors4

Sum of divisors σ(n)14,400

Aliquot sum259sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)6,942the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 13,884

Möbius function μ(n)+12 distinct prime factors, an even number of them

SquarefreeYesno repeated prime factor

All divisors1, 79, 179, 14,1414 in total

Arithmetic

Previous number14,140

Next number14,142

Double28,282

Half7,070.5

Square199,967,881

Cube2,827,745,805,221

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

Cube root24.182064437≈

Negation-14,141

Reciprocal0.0000707164≈

Representations

Decimal14,141

Binary1101110011110114 bits

Octal33475

Hexadecimal373D

Base 36AWT

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

In wordsfourteen thousand, one hundred and forty-one

Ordinalfourteen thousand, one hundred and forty-first

Scientific notation1.4141 × 10^4

Engineering notation14.141 × 10^3

In other bases

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

Quinary423031base 5; one hand: 6 digits

Septenary56141base 7: 5 digits

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

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

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

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

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

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

Bit-level

0011011100111101

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

Bytes237 3d

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

At each machine width

16-bit0011011100111101

32-bit00000000000000000011011100111101

64-bit0000000000000000000000000000000000000000000000000011011100111101

One's complement1100100011000010at 16 bits, every bit flipped

Bits reversed1011110011101100at 16 bits

Rotated left by 10110111001111010at 16 bits, wrapping

Shifted left by 1110111001111010= 28,282, no wrap

Shifted right by 11101110011110= 7,070, discarding the low bit

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

Nearest landmarks

Next prime14,143+2

Previous prime14,107−34

Distance to nearest prime2

Nearest square below13,924

Nearest square above14,161

Powers & multiples

14,141 to the power 2199,967,881

14,141 to the power 32,827,745,805,221

14,141 to the power 439,987,153,431,630,161

14,141 to the power 5565,458,336,676,682,106,701

First ten multiples14,141, 28,282, 42,423, 56,564, 70,705, 84,846, 98,987, 113,128, 127,269, 141,410

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

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 2

Divisible by 4No, remainder 1

Divisible by 5No, remainder 1

Divisible by 6No, remainder 5

Divisible by 7No, remainder 1

Divisible by 8No, remainder 5

Divisible by 9No, remainder 2

Divisible by 10No, remainder 1

Divisible by 11No, remainder 6

Divisible by 12No, remainder 5

Divisible by 100No, remainder 41

Collatz (3n + 1) trajectory

Steps to reach 1151the total stopping time

Highest value reached42,4243× the starting value

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

First steps14,141 → 42,424 → 21,212 → 10,606 → 5,303 → 15,910 → 7,955 → 23,866 → 11,933 → 35,800 → …

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

As a percentage & fraction

As a percentage1,414,100%

14,141% as a decimal141.41

14,141% of 10014,141

14,141% of 1,000141,410

As a fraction of 10014,141/100

Read another way

As seconds3 hours, 55 minutes and 41 seconds

As bytes13.81 KiB

As a 24-bit colour#00373D

Keep nerding

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