Nerdulator> put something in

Recognised as Number

14,286

  • Positive
  • Even
  • Composite
  • 5 digits

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

Number properties

ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value14,286
Digit count5
Digit sum21
Digit product384
Multiplicative persistence5times the digit product can be taken before one digit is left
Digital root3repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 3 × 2,381
Distinct prime factors32, 3, 2,381
Number of divisors8
Sum of divisors σ(n)28,584
Aliquot sum14,298sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)4,760integers below n that share no factor with it
Carmichael function λ(n)2,380the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 4,760
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 3, 6, 2,381, 4,762, 7,143, 14,2868 in total

Arithmetic

Previous number14,285
Next number14,287
Double28,572
Half7,143
Square root119.524056156≈irrational, shown to 9 decimal places
Cube root24.264436793≈
Negation-14,286
Reciprocal0.0000699986≈

Representations

Decimal14,286
Binary1101111100111014 bits
Octal33716
Hexadecimal37CE
Base 36B0U
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfourteen thousand, two hundred and eighty-six
Ordinalfourteen thousand, two hundred and eighty-sixth
Scientific notation1.4286 × 10^4
Engineering notation14.286 × 10^3

In other bases

Ternary201121010base 3; the most digit-efficient integer base after e: 9 digits
Quinary424121base 5; one hand: 6 digits
Septenary56436base 7: 5 digits
Nonary21533base 9; each digit is two ternary digits: 5 digits
Duodecimal8326base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits
Vigesimal1fe6base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal3:58:6base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1T1TTT1010digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100100011010010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

0011011111001110
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 even
Highest set bitbit 13worth 8,192
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes237 ce
Gray code10110000101001n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit0011011111001110
32-bit00000000000000000011011111001110
64-bit0000000000000000000000000000000000000000000000000011011111001110
One's complement1100100000110001at 16 bits, every bit flipped
Bits reversed0111001111101100at 16 bits
Rotated left by 10110111110011100at 16 bits, wrapping
Shifted left by 1110111110011100= 28,572, no wrap
Shifted right by 11101111100111= 7,143, discarding the low bit
These bits as a double7.05822182 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime14,293+7
Previous prime14,281−5
Distance to nearest prime5
Nearest square below14,161
Nearest square above14,400

Powers & multiples

14,286 to the power 2204,089,796
14,286 to the power 32,915,626,825,656
14,286 to the power 441,652,644,831,321,616
14,286 to the power 5595,049,684,060,260,606,176
First ten multiples14,286, 28,572, 42,858, 57,144, 71,430, 85,716, 100,002, 114,288, 128,574, 142,860
Powers of twoBetween 2^13 (8,192) and 2^14 (16,384)

Divisibility tests

Divisible by 2Yes
Divisible by 3Yes
Divisible by 4No, remainder 2
Divisible by 5No, remainder 1
Divisible by 6Yes
Divisible by 7No, remainder 6
Divisible by 8No, remainder 6
Divisible by 9No, remainder 3
Divisible by 10No, remainder 6
Divisible by 11No, remainder 8
Divisible by 12No, remainder 6
Divisible by 100No, remainder 86

Collatz (3n + 1) trajectory

Steps to reach 1195the total stopping time
Highest value reached81,3765× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps14,286 → 7,143 → 21,430 → 10,715 → 32,146 → 16,073 → 48,220 → 24,110 → 12,055 → 36,166 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage1,428,600%
14,286% as a decimal142.86
14,286% of 10014,286
14,286% of 1,000142,860
As a fraction of 10014,286/100

Read another way

As bytes13.951 KiB
As a 24-bit colour#0037CE

Keep nerding

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

Nerdulate something else

Nothing in mind? Surprise me · today’s page

Every value on this page was computed from “14286” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.