Number

39,237

Positive
Odd
Composite
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value39,237

Digit count5

Digit sum24

Digital root6repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3 × 11 × 29 × 41

Distinct prime factors43, 11, 29, 41

Number of divisors16

Sum of divisors σ(n)60,480

Aliquot sum21,243sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

SquarefreeYesno repeated prime factor

All divisors1, 3, 11, 29, 33, 41, 87, 123, 319, 451, 957, 1,189, 1,353, 3,567, 13,079, 39,23716 in total

Arithmetic

Previous number39,236

Next number39,238

Double78,474

Half19,618.5

Square1,539,542,169

Cube60,407,016,085,053

Square root198.083315804≈irrational, shown to 9 decimal places

Cube root33.980669519≈

Negation-39,237

Reciprocal0.0000254861≈

Representations

Decimal39,237

Binary100110010100010116 bits

Octal114505

Hexadecimal9945

Base 36U9X

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

In wordsthirty-nine thousand, two hundred and thirty-seven

Ordinalthirty-nine thousand, two hundred and thirty-seventh

Scientific notation3.9237 × 10^4

Engineering notation39.237 × 10^3

Nearest landmarks

Next prime39,239+2

Previous prime39,233−4

Distance to nearest prime2

Nearest square below39,204

Nearest square above39,601

Powers & multiples

39,237 to the power 21,539,542,169

39,237 to the power 360,407,016,085,053

39,237 to the power 42,370,190,090,129,224,561

39,237 to the power 592,999,148,566,400,384,099,957

First ten multiples39,237, 78,474, 117,711, 156,948, 196,185, 235,422, 274,659, 313,896, 353,133, 392,370

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

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3Yes

Divisible by 4No, remainder 1

Divisible by 5No, remainder 2

Divisible by 6No, remainder 3

Divisible by 7No, remainder 2

Divisible by 8No, remainder 5

Divisible by 9No, remainder 6

Divisible by 10No, remainder 7

Divisible by 11Yes

Divisible by 12No, remainder 9

Divisible by 100No, remainder 37

Collatz (3n + 1) trajectory

Steps to reach 1168the total stopping time

Highest value reached117,7123× the starting value

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

First steps39,237 → 117,712 → 58,856 → 29,428 → 14,714 → 7,357 → 22,072 → 11,036 → 5,518 → 2,759 → …

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

As a percentage & fraction

As a percentage3,923,700%

39,237% as a decimal392.37

39,237% of 10039,237

39,237% of 1,000392,370

As a fraction of 10039,237/100

Read another way

As seconds10 hours, 53 minutes and 57 seconds

As bytes38.317 KiB

As a 24-bit colour#009945

Keep nerding

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