Recognised as Number

39,249

Positive
Odd
Composite
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value39,249

Digit count5

Digit sum27

Digit product1,944

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

Digital root9repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3^2 × 7^2 × 89

Distinct prime factors33, 7, 89

Number of divisors18

Sum of divisors σ(n)66,690

Aliquot sum27,441sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)1,848the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 22,176

Möbius function μ(n)0zero, because a prime divides n twice

SquarefreeNohas a repeated prime factor

All divisors1, 3, 7, 9, 21, 49, 63, 89, 147, 267, 441, 623, 801, 1,869, 4,361, 5,607, 13,083, 39,24918 in total

Arithmetic

Previous number39,248

Next number39,250

Double78,498

Half19,624.5

Square1,540,484,001

Cube60,462,456,555,249

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

Cube root33.984133312≈

Negation-39,249

Reciprocal0.0000254784≈

Representations

Decimal39,249

Binary100110010101000116 bits

Octal114521

Hexadecimal9951

Base 36UA9

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

In wordsthirty-nine thousand, two hundred and forty-nine

Ordinalthirty-nine thousand, two hundred and forty-ninth

Scientific notation3.9249 × 10^4

Engineering notation39.249 × 10^3

In other bases

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

Quinary2223444base 5; one hand: 7 digits

Septenary222300base 7: 6 digits

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

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

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

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

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

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

Bit-level

1001100101010001

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

Bytes299 51

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

At each machine width

16-bit1001100101010001

32-bit00000000000000001001100101010001

64-bit0000000000000000000000000000000000000000000000001001100101010001

One's complement0110011010101110at 16 bits, every bit flipped

Bits reversed1000101010011001at 16 bits

Rotated left by 10011001010100011at 16 bits, wrapping

Shifted left by 110011001010100010= 78,498, no wrap

Shifted right by 1100110010101000= 19,624, discarding the low bit

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

Nearest landmarks

Next prime39,251+2

Previous prime39,241−8

Distance to nearest prime2

Nearest square below39,204

Nearest square above39,601

Powers & multiples

39,249 to the power 21,540,484,001

39,249 to the power 360,462,456,555,249

39,249 to the power 42,373,090,957,336,968,001

39,249 to the power 593,141,446,984,518,657,071,249

First ten multiples39,249, 78,498, 117,747, 156,996, 196,245, 235,494, 274,743, 313,992, 353,241, 392,490

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 4

Divisible by 6No, remainder 3

Divisible by 7Yes

Divisible by 8No, remainder 1

Divisible by 9Yes

Divisible by 10No, remainder 9

Divisible by 11No, remainder 1

Divisible by 12No, remainder 9

Divisible by 100No, remainder 49

Collatz (3n + 1) trajectory

Steps to reach 1150the total stopping time

Highest value reached453,25611× the starting value

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

First steps39,249 → 117,748 → 58,874 → 29,437 → 88,312 → 44,156 → 22,078 → 11,039 → 33,118 → 16,559 → …

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

As a percentage & fraction

As a percentage3,924,900%

39,249% as a decimal392.49

39,249% of 10039,249

39,249% of 1,000392,490

As a fraction of 10039,249/100

Read another way

As seconds10 hours, 54 minutes and 9 seconds

As bytes38.329 KiB

As a 24-bit colour#009951

Keep nerding

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