Nerdulator> put something in

Recognised as Number

39,137

  • Positive
  • Odd
  • Composite
  • 5 digits

39,137 is an odd 5-digit integer and a composite number. It has 4 divisors and a digital root of 5.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value39,137
Digit count5
Digit sum23
Digit product567
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation7 × 5,591
Distinct prime factors27, 5,591
Number of divisors4
Sum of divisors σ(n)44,736
Aliquot sum5,599sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)33,540integers below n that share no factor with it
Carmichael function λ(n)16,770the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 33,540
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 7, 5,591, 39,1374 in total

Arithmetic

Previous number39,136
Next number39,138
Double78,274
Square root197.830735731≈irrational, shown to 9 decimal places
Cube root33.951777081≈
Negation-39,137
Reciprocal0.0000255513≈

Representations

Decimal39,137
Binary100110001110000116 bits
Octal114341
Hexadecimal98E1
Base 36U75
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthirty-nine thousand, one hundred and thirty-seven
Ordinalthirty-nine thousand, one hundred and thirty-seventh
Scientific notation3.9137 × 10^4
Engineering notation39.137 × 10^3

In other bases

Ternary1222200112base 3; the most digit-efficient integer base after e: 10 digits
Quinary2223022base 5; one hand: 7 digits
Septenary222050base 7: 6 digits
Nonary58615base 9; each digit is two ternary digits: 5 digits
Duodecimal1a795base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal4hghbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal10:52:17base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1T000T01TTTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11110100100100001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

1001100011100001
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
Bytes298 e1
Gray code1101010010010001n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1001100011100001
32-bit00000000000000001001100011100001
64-bit0000000000000000000000000000000000000000000000001001100011100001
One's complement0110011100011110at 16 bits, every bit flipped
Bits reversed1000011100011001at 16 bits
Rotated left by 10011000111000011at 16 bits, wrapping
Shifted left by 110011000111000010= 78,274, no wrap
Shifted right by 1100110001110000= 19,568, discarding the low bit
These bits as a double1.93362472 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime39,139+2
Previous prime39,133−4
Distance to nearest prime2
Nearest square below38,809
Nearest square above39,204

Powers & multiples

39,137 to the power 21,531,704,769
39,137 to the power 359,946,329,544,353
39,137 to the power 42,346,119,499,377,343,361
39,137 to the power 591,820,078,847,131,087,119,457
First ten multiples39,137, 78,274, 117,411, 156,548, 195,685, 234,822, 273,959, 313,096, 352,233, 391,370
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 1
Divisible by 5No, remainder 2
Divisible by 6No, remainder 5
Divisible by 7Yes
Divisible by 8No, remainder 1
Divisible by 9No, remainder 5
Divisible by 10No, remainder 7
Divisible by 11No, remainder 10
Divisible by 12No, remainder 5
Divisible by 100No, remainder 37

Collatz (3n + 1) trajectory

Steps to reach 180the total stopping time
Highest value reached1,692,73643× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps39,137 → 117,412 → 58,706 → 29,353 → 88,060 → 44,030 → 22,015 → 66,046 → 33,023 → 99,070 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage3,913,700%
39,137% as a decimal391.37
39,137% of 10039,137
39,137% of 1,000391,370
As a fraction of 10039,137/100

Read another way

As bytes38.22 KiB
As a 24-bit colour#0098E1

Keep nerding

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

Nerdulate something else

Nothing in mind? Surprise me · today’s page

Every value on this page was computed from “39137” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.