Recognised as Number

14,290

Positive
Even
Composite
5 digits

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

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value14,290

Digit count5

Digit sum16

Digit product0zero, because one of the digits is zero

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

Digital root7repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 5 × 1,429

Distinct prime factors32, 5, 1,429

Number of divisors8

Sum of divisors σ(n)25,740

Aliquot sum11,450sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

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

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

SquarefreeYesno repeated prime factor

All divisors1, 2, 5, 10, 1,429, 2,858, 7,145, 14,2908 in total

Arithmetic

Previous number14,289

Next number14,291

Double28,580

Half7,145

Square204,204,100

Cube2,918,076,589,000

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

Cube root24.266701217≈

Negation-14,290

Reciprocal0.000069979≈

Representations

Decimal14,290

Binary1101111101001014 bits

Octal33722

Hexadecimal37D2

Base 36B0Y

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

In wordsfourteen thousand, two hundred and ninety

Ordinalfourteen thousand, two hundred and ninetieth

Scientific notation1.429 × 10^4

Engineering notation14.29 × 10^3

In other bases

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

Quinary424130base 5; one hand: 6 digits

Septenary56443base 7: 5 digits

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

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

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

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

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

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

Bit-level

0011011111010010

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 even

Highest set bitbit 13worth 8,192

Lowest set bitbit 11 trailing zero

Power of twoNo

Bytes237 d2

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

At each machine width

16-bit0011011111010010

32-bit00000000000000000011011111010010

64-bit0000000000000000000000000000000000000000000000000011011111010010

One's complement1100100000101101at 16 bits, every bit flipped

Bits reversed0100101111101100at 16 bits

Rotated left by 10110111110100100at 16 bits, wrapping

Shifted left by 1110111110100100= 28,580, no wrap

Shifted right by 11101111101001= 7,145, discarding the low bit

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

Nearest landmarks

Next prime14,293+3

Previous prime14,281−9

Distance to nearest prime3

Nearest square below14,161

Nearest square above14,400

Powers & multiples

14,290 to the power 2204,204,100

14,290 to the power 32,918,076,589,000

14,290 to the power 441,699,314,456,810,000

14,290 to the power 5595,883,203,587,814,900,000

First ten multiples14,290, 28,580, 42,870, 57,160, 71,450, 85,740, 100,030, 114,320, 128,610, 142,900

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 3

Divisible by 8No, remainder 2

Divisible by 9No, remainder 7

Divisible by 10Yes

Divisible by 11No, remainder 1

Divisible by 12No, remainder 10

Divisible by 100No, remainder 90

Collatz (3n + 1) trajectory

Steps to reach 1195the total stopping time

Highest value reached695,46448× the starting value

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

First steps14,290 → 7,145 → 21,436 → 10,718 → 5,359 → 16,078 → 8,039 → 24,118 → 12,059 → 36,178 → …

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

As a percentage & fraction

As a percentage1,429,000%

14,290% as a decimal142.9

14,290% of 10014,290

14,290% of 1,000142,900

As a fraction of 10014,290/100

Read another way

As seconds3 hours, 58 minutes and 10 seconds

As bytes13.955 KiB

As a 24-bit colour#0037D2

Keep nerding

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