Recognised as Number

14,281

Positive
Odd
Prime
5 digits

14,281 is an odd 5-digit integer and a prime number. It has 2 divisors and a digital root of 7.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value14,281

Digit count5

Digit sum16

Digit product64

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

Digital root7repeated digit sum

PalindromicNoreads differently backwards

Happy numberYessquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation14,281

Distinct prime factors114,281

Number of divisors2

Sum of divisors σ(n)14,282

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)14,280the smallest exponent with aˣ ≡ 1 for every unit coprime to n

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

SquarefreeYesno repeated prime factor

All divisors1, 14,2812 in total

Arithmetic

Previous number14,280

Next number14,282

Double28,562

Half7,140.5

Square203,946,961

Cube2,912,566,550,041

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

Cube root24.261605668≈

Negation-14,281

Reciprocal0.0000700231≈

Representations

Decimal14,281

Binary1101111100100114 bits

Octal33711

Hexadecimal37C9

Base 36B0P

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

In wordsfourteen thousand, two hundred and eighty-one

Ordinalfourteen thousand, two hundred and eighty-first

Scientific notation1.4281 × 10^4

Engineering notation14.281 × 10^3

In other bases

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

Quinary424111base 5; one hand: 6 digits

Septenary56431base 7: 5 digits

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

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

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

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

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

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

Bit-level

0011011111001001

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 c9

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

At each machine width

16-bit0011011111001001

32-bit00000000000000000011011111001001

64-bit0000000000000000000000000000000000000000000000000011011111001001

One's complement1100100000110110at 16 bits, every bit flipped

Bits reversed1001001111101100at 16 bits

Rotated left by 10110111110010010at 16 bits, wrapping

Shifted left by 1110111110010010= 28,562, no wrap

Shifted right by 11101111100100= 7,140, discarding the low bit

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

Nearest landmarks

Next prime14,293+12

Previous prime14,251−30

Distance to nearest prime0, it is prime

Nearest square below14,161

Nearest square above14,400

Powers & multiples

14,281 to the power 2203,946,961

14,281 to the power 32,912,566,550,041

14,281 to the power 441,594,362,901,135,521

14,281 to the power 5594,009,096,591,116,375,401

First ten multiples14,281, 28,562, 42,843, 57,124, 71,405, 85,686, 99,967, 114,248, 128,529, 142,810

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 1

Divisible by 5No, remainder 1

Divisible by 6No, remainder 1

Divisible by 7No, remainder 1

Divisible by 8No, remainder 1

Divisible by 9No, remainder 7

Divisible by 10No, remainder 1

Divisible by 11No, remainder 3

Divisible by 12No, remainder 1

Divisible by 100No, remainder 81

Collatz (3n + 1) trajectory

Steps to reach 1102the total stopping time

Highest value reached72,3045× the starting value

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

First steps14,281 → 42,844 → 21,422 → 10,711 → 32,134 → 16,067 → 48,202 → 24,101 → 72,304 → 36,152 → …

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

As a percentage & fraction

As a percentage1,428,100%

14,281% as a decimal142.81

14,281% of 10014,281

14,281% of 1,000142,810

As a fraction of 10014,281/100

Read another way

As seconds3 hours, 58 minutes and 1 second

As bytes13.946 KiB

As a 24-bit colour#0037C9

Keep nerding

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