Recognised as Number

12,589

Positive
Odd
Prime
5 digits

12,589 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 value12,589

Digit count5

Digit sum25

Digit product720

Multiplicative persistence2times 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 factorisation12,589

Distinct prime factors112,589

Number of divisors2

Sum of divisors σ(n)12,590

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)12,588the 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, 12,5892 in total

Arithmetic

Previous number12,588

Next number12,590

Double25,178

Half6,294.5

Square158,482,921

Cube1,995,141,492,469

Square root112.20071301≈irrational, shown to 9 decimal places

Cube root23.262894147≈

Negation-12,589

Reciprocal0.0000794344≈

Representations

Decimal12,589

Binary1100010010110114 bits

Octal30455

Hexadecimal312D

Base 369PP

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

In wordstwelve thousand, five hundred and eighty-nine

Ordinaltwelve thousand, five hundred and eighty-ninth

Scientific notation1.2589 × 10^4

Engineering notation12.589 × 10^3

In other bases

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

Quinary400324base 5; one hand: 6 digits

Septenary51463base 7: 5 digits

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

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

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

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

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

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

Bit-level

0011000100101101

Bit length14 bitsto write the magnitude

Set bits7the population count, or Hamming weight

Zero bits7within that length

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

Bytes231 2d

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

At each machine width

16-bit0011000100101101

32-bit00000000000000000011000100101101

64-bit0000000000000000000000000000000000000000000000000011000100101101

One's complement1100111011010010at 16 bits, every bit flipped

Bits reversed1011010010001100at 16 bits

Rotated left by 10110001001011010at 16 bits, wrapping

Shifted left by 1110001001011010= 25,178, no wrap

Shifted right by 11100010010110= 6,294, discarding the low bit

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

Nearest landmarks

Next prime12,601+12

Previous prime12,583−6

Distance to nearest prime0, it is prime

Nearest square below12,544

Nearest square above12,769

Powers & multiples

12,589 to the power 2158,482,921

12,589 to the power 31,995,141,492,469

12,589 to the power 425,116,836,248,692,241

12,589 to the power 5316,195,851,534,786,621,949

First ten multiples12,589, 25,178, 37,767, 50,356, 62,945, 75,534, 88,123, 100,712, 113,301, 125,890

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 4

Divisible by 6No, remainder 1

Divisible by 7No, remainder 3

Divisible by 8No, remainder 5

Divisible by 9No, remainder 7

Divisible by 10No, remainder 9

Divisible by 11No, remainder 5

Divisible by 12No, remainder 1

Divisible by 100No, remainder 89

Collatz (3n + 1) trajectory

Steps to reach 1125the total stopping time

Highest value reached37,7683× the starting value

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

First steps12,589 → 37,768 → 18,884 → 9,442 → 4,721 → 14,164 → 7,082 → 3,541 → 10,624 → 5,312 → …

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

As a percentage & fraction

As a percentage1,258,900%

12,589% as a decimal125.89

12,589% of 10012,589

12,589% of 1,000125,890

As a fraction of 10012,589/100

Read another way

As seconds3 hours, 29 minutes and 49 seconds

As bytes12.294 KiB

As a 24-bit colour#00312D

Keep nerding

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