Recognised as Number

38,593

Positive
Odd
Prime
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value38,593

Digit count5

Digit sum28

Digit product3,240

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

Digital root1repeated digit sum

PalindromicNoreads differently backwards

Happy numberYessquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation38,593

Distinct prime factors138,593

Number of divisors2

Sum of divisors σ(n)38,594

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

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

Arithmetic

Previous number38,592

Next number38,594

Double77,186

Half19,296.5

Square1,489,419,649

Cube57,481,172,513,857

Square root196.451011705≈irrational, shown to 9 decimal places

Cube root33.793733885≈

Negation-38,593

Reciprocal0.0000259114≈

Representations

Decimal38,593

Binary100101101100000116 bits

Octal113301

Hexadecimal96C1

Base 36TS1

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

In wordsthirty-eight thousand, five hundred and ninety-three

Ordinalthirty-eight thousand, five hundred and ninety-third

Scientific notation3.8593 × 10^4

Engineering notation38.593 × 10^3

In other bases

Ternary1221221101base 3; the most digit-efficient integer base after e: 10 digits

Quinary2213333base 5; one hand: 7 digits

Septenary220342base 7: 6 digits

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

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

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

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

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

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

Bit-level

1001011011000001

Bit length16 bitsto write the magnitude

Set bits7the population count, or Hamming weight

Zero bits9within that length

Bit parityodd7 set bits, so odd; not the same as the number itself being odd

Highest set bitbit 15worth 32,768

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes296 c1

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

At each machine width

16-bit1001011011000001

32-bit00000000000000001001011011000001

64-bit0000000000000000000000000000000000000000000000001001011011000001

One's complement0110100100111110at 16 bits, every bit flipped

Bits reversed1000001101101001at 16 bits

Rotated left by 10010110110000011at 16 bits, wrapping

Shifted left by 110010110110000010= 77,186, no wrap

Shifted right by 1100101101100000= 19,296, discarding the low bit

These bits as a double1.90674755 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime38,603+10

Previous prime38,569−24

Distance to nearest prime0, it is prime

Nearest square below38,416

Nearest square above38,809

Powers & multiples

38,593 to the power 21,489,419,649

38,593 to the power 357,481,172,513,857

38,593 to the power 42,218,370,890,827,283,201

38,593 to the power 585,613,587,789,697,340,576,193

First ten multiples38,593, 77,186, 115,779, 154,372, 192,965, 231,558, 270,151, 308,744, 347,337, 385,930

Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)

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 2

Divisible by 8No, remainder 1

Divisible by 9No, remainder 1

Divisible by 10No, remainder 3

Divisible by 11No, remainder 5

Divisible by 12No, remainder 1

Divisible by 100No, remainder 93

Collatz (3n + 1) trajectory

Steps to reach 1168the total stopping time

Highest value reached115,7803× the starting value

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

First steps38,593 → 115,780 → 57,890 → 28,945 → 86,836 → 43,418 → 21,709 → 65,128 → 32,564 → 16,282 → …

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

As a percentage & fraction

As a percentage3,859,300%

38,593% as a decimal385.93

38,593% of 10038,593

38,593% of 1,000385,930

As a fraction of 10038,593/100

Read another way

As seconds10 hours, 43 minutes and 13 seconds

As bytes37.688 KiB

As a 24-bit colour#0096C1

Keep nerding

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