Recognised as Number

14,591

Positive
Odd
Prime
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value14,591

Digit count5

Digit sum20

Digit product180

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

Digital root2repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation14,591

Distinct prime factors114,591

Number of divisors2

Sum of divisors σ(n)14,592

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)14,590the 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,5912 in total

Arithmetic

Previous number14,590

Next number14,592

Double29,182

Half7,295.5

Square212,897,281

Cube3,106,384,227,071

Square root120.79321173≈irrational, shown to 9 decimal places

Cube root24.435900749≈

Negation-14,591

Reciprocal0.0000685354≈

Representations

Decimal14,591

Binary1110001111111114 bits

Octal34377

Hexadecimal38FF

Base 36B9B

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

In wordsfourteen thousand, five hundred and ninety-one

Ordinalfourteen thousand, five hundred and ninety-first

Scientific notation1.4591 × 10^4

Engineering notation14.591 × 10^3

In other bases

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

Quinary431331base 5; one hand: 6 digits

Septenary60353base 7: 5 digits

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

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

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

Sexagesimal4:3:11base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

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

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

Bit-level

0011100011111111

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

Bytes238 ff

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

At each machine width

16-bit0011100011111111

32-bit00000000000000000011100011111111

64-bit0000000000000000000000000000000000000000000000000011100011111111

One's complement1100011100000000at 16 bits, every bit flipped

Bits reversed1111111100011100at 16 bits

Rotated left by 10111000111111110at 16 bits, wrapping

Shifted left by 1111000111111110= 29,182, no wrap

Shifted right by 11110001111111= 7,295, discarding the low bit

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

Nearest landmarks

Next prime14,593+2

Previous prime14,563−28

Distance to nearest prime0, it is prime

Nearest square below14,400

Nearest square above14,641

Powers & multiples

14,591 to the power 2212,897,281

14,591 to the power 33,106,384,227,071

14,591 to the power 445,325,252,257,192,961

14,591 to the power 5661,340,755,684,702,493,951

First ten multiples14,591, 29,182, 43,773, 58,364, 72,955, 87,546, 102,137, 116,728, 131,319, 145,910

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

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 2

Divisible by 4No, remainder 3

Divisible by 5No, remainder 1

Divisible by 6No, remainder 5

Divisible by 7No, remainder 3

Divisible by 8No, remainder 7

Divisible by 9No, remainder 2

Divisible by 10No, remainder 1

Divisible by 11No, remainder 5

Divisible by 12No, remainder 11

Divisible by 100No, remainder 91

Collatz (3n + 1) trajectory

Steps to reach 189the total stopping time

Highest value reached747,95251× the starting value

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

First steps14,591 → 43,774 → 21,887 → 65,662 → 32,831 → 98,494 → 49,247 → 147,742 → 73,871 → 221,614 → …

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

As a percentage & fraction

As a percentage1,459,100%

14,591% as a decimal145.91

14,591% of 10014,591

14,591% of 1,000145,910

As a fraction of 10014,591/100

Read another way

As seconds4 hours, 3 minutes and 11 seconds

As bytes14.249 KiB

As a 24-bit colour#0038FF

Keep nerding

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