Recognised as Number

14,289

Positive
Odd
Composite
5 digits

14,289 is an odd 5-digit integer and a composite number. It has 8 divisors and a digital root of 6.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value14,289

Digit count5

Digit sum24

Digit product576

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

Digital root6repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3 × 11 × 433

Distinct prime factors33, 11, 433

Number of divisors8

Sum of divisors σ(n)20,832

Aliquot sum6,543sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

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

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

SquarefreeYesno repeated prime factor

All divisors1, 3, 11, 33, 433, 1,299, 4,763, 14,2898 in total

Arithmetic

Previous number14,288

Next number14,290

Double28,578

Half7,144.5

Square204,175,521

Cube2,917,464,019,569

Square root119.536605272≈irrational, shown to 9 decimal places

Cube root24.266135151≈

Negation-14,289

Reciprocal0.0000699839≈

Representations

Decimal14,289

Binary1101111101000114 bits

Octal33721

Hexadecimal37D1

Base 36B0X

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

In wordsfourteen thousand, two hundred and eighty-nine

Ordinalfourteen thousand, two hundred and eighty-ninth

Scientific notation1.4289 × 10^4

Engineering notation14.289 × 10^3

In other bases

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

Quinary424124base 5; one hand: 6 digits

Septenary56442base 7: 5 digits

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

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

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

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

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

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

Bit-level

0011011111010001

Bit length14 bitsto write the magnitude

Set bits9the population count, or Hamming weight

Zero bits5within that length

Bit parityodd9 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 d1

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

At each machine width

16-bit0011011111010001

32-bit00000000000000000011011111010001

64-bit0000000000000000000000000000000000000000000000000011011111010001

One's complement1100100000101110at 16 bits, every bit flipped

Bits reversed1000101111101100at 16 bits

Rotated left by 10110111110100010at 16 bits, wrapping

Shifted left by 1110111110100010= 28,578, no wrap

Shifted right by 11101111101000= 7,144, discarding the low bit

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

Nearest landmarks

Next prime14,293+4

Previous prime14,281−8

Distance to nearest prime4

Nearest square below14,161

Nearest square above14,400

Powers & multiples

14,289 to the power 2204,175,521

14,289 to the power 32,917,464,019,569

14,289 to the power 441,687,643,375,621,441

14,289 to the power 5595,674,736,194,254,770,449

First ten multiples14,289, 28,578, 42,867, 57,156, 71,445, 85,734, 100,023, 114,312, 128,601, 142,890

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

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3Yes

Divisible by 4No, remainder 1

Divisible by 5No, remainder 4

Divisible by 6No, remainder 3

Divisible by 7No, remainder 2

Divisible by 8No, remainder 1

Divisible by 9No, remainder 6

Divisible by 10No, remainder 9

Divisible by 11Yes

Divisible by 12No, remainder 9

Divisible by 100No, remainder 89

Collatz (3n + 1) trajectory

Steps to reach 132the total stopping time

Highest value reached42,8683× the starting value

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

First steps14,289 → 42,868 → 21,434 → 10,717 → 32,152 → 16,076 → 8,038 → 4,019 → 12,058 → 6,029 → …

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

As a percentage & fraction

As a percentage1,428,900%

14,289% as a decimal142.89

14,289% of 10014,289

14,289% of 1,000142,890

As a fraction of 10014,289/100

Read another way

As seconds3 hours, 58 minutes and 9 seconds

As bytes13.954 KiB

As a 24-bit colour#0037D1

Keep nerding

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