Recognised as Number

39,023

Positive
Odd
Prime
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value39,023

Digit count5

Digit sum17

Digit product0zero, because one of the digits is zero

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

Digital root8repeated digit sum

PalindromicNoreads differently backwards

Happy numberYessquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation39,023

Distinct prime factors139,023

Number of divisors2

Sum of divisors σ(n)39,024

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)39,022the 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, 39,0232 in total

Arithmetic

Previous number39,022

Next number39,024

Double78,046

Half19,511.5

Square1,522,794,529

Cube59,424,010,905,167

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

Cube root33.918779604≈

Negation-39,023

Reciprocal0.0000256259≈

Representations

Decimal39,023

Binary100110000110111116 bits

Octal114157

Hexadecimal986F

Base 36U3Z

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

In wordsthirty-nine thousand and twenty-three

Ordinalthirty-nine thousand and twenty-third

Scientific notation3.9023 × 10^4

Engineering notation39.023 × 10^3

In other bases

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

Quinary2222043base 5; one hand: 7 digits

Septenary221525base 7: 6 digits

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

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

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

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

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

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

Bit-level

1001100001101111

Bit length16 bitsto write the magnitude

Set bits9the population count, or Hamming weight

Zero bits7within that length

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

Bytes298 6f

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

At each machine width

16-bit1001100001101111

32-bit00000000000000001001100001101111

64-bit0000000000000000000000000000000000000000000000001001100001101111

One's complement0110011110010000at 16 bits, every bit flipped

Bits reversed1111011000011001at 16 bits

Rotated left by 10011000011011111at 16 bits, wrapping

Shifted left by 110011000011011110= 78,046, no wrap

Shifted right by 1100110000110111= 19,511, discarding the low bit

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

Nearest landmarks

Next prime39,041+18

Previous prime39,019−4

Distance to nearest prime0, it is prime

Nearest square below38,809

Nearest square above39,204

Powers & multiples

39,023 to the power 21,522,794,529

39,023 to the power 359,424,010,905,167

39,023 to the power 42,318,903,177,552,331,841

39,023 to the power 590,490,558,697,624,645,431,343

First ten multiples39,023, 78,046, 117,069, 156,092, 195,115, 234,138, 273,161, 312,184, 351,207, 390,230

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

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 2

Divisible by 4No, remainder 3

Divisible by 5No, remainder 3

Divisible by 6No, remainder 5

Divisible by 7No, remainder 5

Divisible by 8No, remainder 7

Divisible by 9No, remainder 8

Divisible by 10No, remainder 3

Divisible by 11No, remainder 6

Divisible by 12No, remainder 11

Divisible by 100No, remainder 23

Collatz (3n + 1) trajectory

Steps to reach 1155the total stopping time

Highest value reached750,11219× the starting value

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

First steps39,023 → 117,070 → 58,535 → 175,606 → 87,803 → 263,410 → 131,705 → 395,116 → 197,558 → 98,779 → …

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

As a percentage & fraction

As a percentage3,902,300%

39,023% as a decimal390.23

39,023% of 10039,023

39,023% of 1,000390,230

As a fraction of 10039,023/100

Read another way

As seconds10 hours, 50 minutes and 23 seconds

As bytes38.108 KiB

As a 24-bit colour#00986F

Keep nerding

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