Recognised as Number

38,959

Positive
Odd
Prime
5 digits

38,959 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 value38,959

Digit count5

Digit sum34

Digit product9,720

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 factorisation38,959

Distinct prime factors138,959

Number of divisors2

Sum of divisors σ(n)38,960

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

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

Arithmetic

Previous number38,958

Next number38,960

Double77,918

Half19,479.5

Square1,517,803,681

Cube59,132,113,608,079

Square root197.3803435≈irrational, shown to 9 decimal places

Cube root33.900226531≈

Negation-38,959

Reciprocal0.000025668≈

Representations

Decimal38,959

Binary100110000010111116 bits

Octal114057

Hexadecimal982F

Base 36U27

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

In wordsthirty-eight thousand, nine hundred and fifty-nine

Ordinalthirty-eight thousand, nine hundred and fifty-ninth

Scientific notation3.8959 × 10^4

Engineering notation38.959 × 10^3

In other bases

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

Quinary2221314base 5; one hand: 7 digits

Septenary221404base 7: 6 digits

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

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

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

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

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

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

Bit-level

1001100000101111

Bit length16 bitsto write the magnitude

Set bits8the population count, or Hamming weight

Zero bits8within that length

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

Highest set bitbit 15worth 32,768

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes298 2f

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

At each machine width

16-bit1001100000101111

32-bit00000000000000001001100000101111

64-bit0000000000000000000000000000000000000000000000001001100000101111

One's complement0110011111010000at 16 bits, every bit flipped

Bits reversed1111010000011001at 16 bits

Rotated left by 10011000001011111at 16 bits, wrapping

Shifted left by 110011000001011110= 77,918, no wrap

Shifted right by 1100110000010111= 19,479, discarding the low bit

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

Nearest landmarks

Next prime38,971+12

Previous prime38,953−6

Distance to nearest prime0, it is prime

Nearest square below38,809

Nearest square above39,204

Powers & multiples

38,959 to the power 21,517,803,681

38,959 to the power 359,132,113,608,079

38,959 to the power 42,303,728,014,057,149,761

38,959 to the power 589,750,939,699,652,497,538,799

First ten multiples38,959, 77,918, 116,877, 155,836, 194,795, 233,754, 272,713, 311,672, 350,631, 389,590

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 3

Divisible by 5No, remainder 4

Divisible by 6No, remainder 1

Divisible by 7No, remainder 4

Divisible by 8No, remainder 7

Divisible by 9No, remainder 7

Divisible by 10No, remainder 9

Divisible by 11No, remainder 8

Divisible by 12No, remainder 7

Divisible by 100No, remainder 59

Collatz (3n + 1) trajectory

Steps to reach 1243the total stopping time

Highest value reached5,764,660147× the starting value

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

First steps38,959 → 116,878 → 58,439 → 175,318 → 87,659 → 262,978 → 131,489 → 394,468 → 197,234 → 98,617 → …

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

As a percentage & fraction

As a percentage3,895,900%

38,959% as a decimal389.59

38,959% of 10038,959

38,959% of 1,000389,590

As a fraction of 10038,959/100

Read another way

As seconds10 hours, 49 minutes and 19 seconds

As bytes38.046 KiB

As a 24-bit colour#00982F

Keep nerding

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