Recognised as Number

14,050

Positive
Even
Composite
5 digits

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

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value14,050

Digit count5

Digit sum10

Digit product0zero, because one of the digits is zero

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

Digital root1repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberYesdivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 5^2 × 281

Distinct prime factors32, 5, 281

Number of divisors12

Sum of divisors σ(n)26,226

Aliquot sum12,176sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

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

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

SquarefreeNohas a repeated prime factor

All divisors1, 2, 5, 10, 25, 50, 281, 562, 1,405, 2,810, 7,025, 14,05012 in total

Arithmetic

Previous number14,049

Next number14,051

Double28,100

Half7,025

Square197,402,500

Cube2,773,505,125,000

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

Cube root24.130080722≈

Negation-14,050

Reciprocal0.0000711744≈

Representations

Decimal14,050

Binary1101101110001014 bits

Octal33342

Hexadecimal36E2

Base 36AUA

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

In wordsfourteen thousand and fifty

Ordinalfourteen thousand and fiftieth

Scientific notation1.405 × 10^4

Engineering notation14.05 × 10^3

In other bases

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

Quinary422200base 5; one hand: 6 digits

Septenary55651base 7: 5 digits

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

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

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

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

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

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

Bit-level

0011011011100010

Bit length14 bitsto write the magnitude

Set bits8the population count, or Hamming weight

Zero bits6within that length

Bit parityeven8 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

Bytes236 e2

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

At each machine width

16-bit0011011011100010

32-bit00000000000000000011011011100010

64-bit0000000000000000000000000000000000000000000000000011011011100010

One's complement1100100100011101at 16 bits, every bit flipped

Bits reversed0100011101101100at 16 bits

Rotated left by 10110110111000100at 16 bits, wrapping

Shifted left by 1110110111000100= 28,100, no wrap

Shifted right by 11101101110001= 7,025, discarding the low bit

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

Nearest landmarks

Next prime14,051+1

Previous prime14,033−17

Distance to nearest prime1

Nearest square below13,924

Nearest square above14,161

Powers & multiples

14,050 to the power 2197,402,500

14,050 to the power 32,773,505,125,000

14,050 to the power 438,967,747,006,250,000

14,050 to the power 5547,496,845,437,812,500,000

First ten multiples14,050, 28,100, 42,150, 56,200, 70,250, 84,300, 98,350, 112,400, 126,450, 140,500

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

Divisibility tests

Divisible by 2Yes

Divisible by 3No, remainder 1

Divisible by 4No, remainder 2

Divisible by 5Yes

Divisible by 6No, remainder 4

Divisible by 7No, remainder 1

Divisible by 8No, remainder 2

Divisible by 9No, remainder 1

Divisible by 10Yes

Divisible by 11No, remainder 3

Divisible by 12No, remainder 10

Divisible by 100No, remainder 50

Collatz (3n + 1) trajectory

Steps to reach 158the total stopping time

Highest value reached21,0761× the starting value

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

First steps14,050 → 7,025 → 21,076 → 10,538 → 5,269 → 15,808 → 7,904 → 3,952 → 1,976 → 988 → …

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

As a percentage & fraction

As a percentage1,405,000%

14,050% as a decimal140.5

14,050% of 10014,050

14,050% of 1,000140,500

As a fraction of 10014,050/100

Read another way

As seconds3 hours, 54 minutes and 10 seconds

As bytes13.721 KiB

As a 24-bit colour#0036E2

Keep nerding

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