Recognised as Number

14,287

Positive
Odd
Composite
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value14,287

Digit count5

Digit sum22

Digit product448

Multiplicative persistence4times 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 factorisation7 × 13 × 157

Distinct prime factors37, 13, 157

Number of divisors8

Sum of divisors σ(n)17,696

Aliquot sum3,409sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)156the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 11,232

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

SquarefreeYesno repeated prime factor

All divisors1, 7, 13, 91, 157, 1,099, 2,041, 14,2878 in total

Arithmetic

Previous number14,286

Next number14,288

Double28,574

Half7,143.5

Square204,118,369

Cube2,916,239,137,903

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

Cube root24.265002938≈

Negation-14,287

Reciprocal0.0000699937≈

Representations

Decimal14,287

Binary1101111100111114 bits

Octal33717

Hexadecimal37CF

Base 36B0V

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

In wordsfourteen thousand, two hundred and eighty-seven

Ordinalfourteen thousand, two hundred and eighty-seventh

Scientific notation1.4287 × 10^4

Engineering notation14.287 × 10^3

In other bases

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

Quinary424122base 5; one hand: 6 digits

Septenary56440base 7: 5 digits

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

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

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

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

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

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

Bit-level

0011011111001111

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 cf

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

At each machine width

16-bit0011011111001111

32-bit00000000000000000011011111001111

64-bit0000000000000000000000000000000000000000000000000011011111001111

One's complement1100100000110000at 16 bits, every bit flipped

Bits reversed1111001111101100at 16 bits

Rotated left by 10110111110011110at 16 bits, wrapping

Shifted left by 1110111110011110= 28,574, no wrap

Shifted right by 11101111100111= 7,143, discarding the low bit

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

Nearest landmarks

Next prime14,293+6

Previous prime14,281−6

Distance to nearest prime6

Nearest square below14,161

Nearest square above14,400

Powers & multiples

14,287 to the power 2204,118,369

14,287 to the power 32,916,239,137,903

14,287 to the power 441,664,308,563,220,161

14,287 to the power 5595,257,976,442,726,440,207

First ten multiples14,287, 28,574, 42,861, 57,148, 71,435, 85,722, 100,009, 114,296, 128,583, 142,870

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 2

Divisible by 6No, remainder 1

Divisible by 7Yes

Divisible by 8No, remainder 7

Divisible by 9No, remainder 4

Divisible by 10No, remainder 7

Divisible by 11No, remainder 9

Divisible by 12No, remainder 7

Divisible by 100No, remainder 87

Collatz (3n + 1) trajectory

Steps to reach 1195the total stopping time

Highest value reached144,66410× the starting value

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

First steps14,287 → 42,862 → 21,431 → 64,294 → 32,147 → 96,442 → 48,221 → 144,664 → 72,332 → 36,166 → …

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

As a percentage & fraction

As a percentage1,428,700%

14,287% as a decimal142.87

14,287% of 10014,287

14,287% of 1,000142,870

As a fraction of 10014,287/100

Read another way

As seconds3 hours, 58 minutes and 7 seconds

As bytes13.952 KiB

As a 24-bit colour#0037CF

Keep nerding

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