Recognised as Number

14,593

Positive
Odd
Prime
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value14,593

Digit count5

Digit sum22

Digit product540

Multiplicative persistence2times 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 factorisation14,593

Distinct prime factors114,593

Number of divisors2

Sum of divisors σ(n)14,594

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

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

Arithmetic

Previous number14,592

Next number14,594

Double29,186

Half7,296.5

Square212,955,649

Cube3,107,661,785,857

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

Cube root24.43701718≈

Negation-14,593

Reciprocal0.000068526≈

Representations

Decimal14,593

Binary1110010000000114 bits

Octal34401

Hexadecimal3901

Base 36B9D

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

In wordsfourteen thousand, five hundred and ninety-three

Ordinalfourteen thousand, five hundred and ninety-third

Scientific notation1.4593 × 10^4

Engineering notation14.593 × 10^3

In other bases

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

Quinary431333base 5; one hand: 6 digits

Septenary60355base 7: 5 digits

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

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

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

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

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

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

Bit-level

0011100100000001

Bit length14 bitsto write the magnitude

Set bits5the population count, or Hamming weight

Zero bits9within that length

Bit parityodd5 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

Bytes239 01

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

At each machine width

16-bit0011100100000001

32-bit00000000000000000011100100000001

64-bit0000000000000000000000000000000000000000000000000011100100000001

One's complement1100011011111110at 16 bits, every bit flipped

Bits reversed1000000010011100at 16 bits

Rotated left by 10111001000000010at 16 bits, wrapping

Shifted left by 1111001000000010= 29,186, no wrap

Shifted right by 11110010000000= 7,296, discarding the low bit

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

Nearest landmarks

Next prime14,621+28

Previous prime14,591−2

Distance to nearest prime0, it is prime

Nearest square below14,400

Nearest square above14,641

Powers & multiples

14,593 to the power 2212,955,649

14,593 to the power 33,107,661,785,857

14,593 to the power 445,350,108,441,011,201

14,593 to the power 5661,794,132,479,676,456,193

First ten multiples14,593, 29,186, 43,779, 58,372, 72,965, 87,558, 102,151, 116,744, 131,337, 145,930

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 3

Divisible by 6No, remainder 1

Divisible by 7No, remainder 5

Divisible by 8No, remainder 1

Divisible by 9No, remainder 4

Divisible by 10No, remainder 3

Divisible by 11No, remainder 7

Divisible by 12No, remainder 1

Divisible by 100No, remainder 93

Collatz (3n + 1) trajectory

Steps to reach 145the total stopping time

Highest value reached43,7803× the starting value

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

First steps14,593 → 43,780 → 21,890 → 10,945 → 32,836 → 16,418 → 8,209 → 24,628 → 12,314 → 6,157 → …

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

As a percentage & fraction

As a percentage1,459,300%

14,593% as a decimal145.93

14,593% of 10014,593

14,593% of 1,000145,930

As a fraction of 10014,593/100

Read another way

As seconds4 hours, 3 minutes and 13 seconds

As bytes14.251 KiB

As a 24-bit colour#003901

Keep nerding

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