Recognised as Number

39,904

Positive
Even
Composite
5 digits

39,904 is an even 5-digit integer and a composite number. It has 24 divisors and a digital root of 7.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value39,904

Digit count5

Digit sum25

Digit product0zero, because one of the digits is zero

Multiplicative persistence1times 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 factorisation2^5 × 29 × 43

Distinct prime factors32, 29, 43

Number of divisors24

Sum of divisors σ(n)83,160

Aliquot sum43,256sum of the proper divisors

ClassificationAbundantthe aliquot sum exceeds the number

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

Carmichael function λ(n)168the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 18,816

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

SquarefreeNohas a repeated prime factor

All divisors1, 2, 4, 8, 16, 29, 32, 43, 58, 86, 116, 172, 232, 344, 464, 688, 928, 1,247, 1,376, 2,494, 4,988, 9,976, 19,952, 39,90424 in total

Arithmetic

Previous number39,903

Next number39,905

Double79,808

Half19,952

Square1,592,329,216

Cube63,540,305,035,264

Square root199.759855827≈irrational, shown to 9 decimal places

Cube root34.172137401≈

Negation-39,904

Reciprocal0.0000250601≈

Representations

Decimal39,904

Binary100110111110000016 bits

Octal115740

Hexadecimal9BE0

Base 36USG

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

In wordsthirty-nine thousand, nine hundred and four

Ordinalthirty-nine thousand, nine hundred and fourth

Scientific notation3.9904 × 10^4

Engineering notation39.904 × 10^3

In other bases

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

Quinary2234104base 5; one hand: 7 digits

Septenary224224base 7: 6 digits

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

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

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

Sexagesimal11:5:4base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

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

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

Bit-level

1001101111100000

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 even

Highest set bitbit 15worth 32,768

Lowest set bitbit 55 trailing zeros

Power of twoNo

Bytes29b e0

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

At each machine width

16-bit1001101111100000

32-bit00000000000000001001101111100000

64-bit0000000000000000000000000000000000000000000000001001101111100000

One's complement0110010000011111at 16 bits, every bit flipped

Bits reversed0000011111011001at 16 bits

Rotated left by 10011011111000001at 16 bits, wrapping

Shifted left by 110011011111000000= 79,808, no wrap

Shifted right by 1100110111110000= 19,952, discarding the low bit

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

Nearest landmarks

Next prime39,929+25

Previous prime39,901−3

Distance to nearest prime3

Nearest square below39,601

Nearest square above40,000

Powers & multiples

39,904 to the power 21,592,329,216

39,904 to the power 363,540,305,035,264

39,904 to the power 42,535,512,332,127,174,656

39,904 to the power 5101,177,084,101,202,777,473,024

First ten multiples39,904, 79,808, 119,712, 159,616, 199,520, 239,424, 279,328, 319,232, 359,136, 399,040

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

Divisibility tests

Divisible by 2Yes

Divisible by 3No, remainder 1

Divisible by 4Yes

Divisible by 5No, remainder 4

Divisible by 6No, remainder 4

Divisible by 7No, remainder 4

Divisible by 8Yes

Divisible by 9No, remainder 7

Divisible by 10No, remainder 4

Divisible by 11No, remainder 7

Divisible by 12No, remainder 4

Divisible by 100No, remainder 4

Collatz (3n + 1) trajectory

Steps to reach 1137the total stopping time

Highest value reached39,904

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

First steps39,904 → 19,952 → 9,976 → 4,988 → 2,494 → 1,247 → 3,742 → 1,871 → 5,614 → 2,807 → …

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

As a percentage & fraction

As a percentage3,990,400%

39,904% as a decimal399.04

39,904% of 10039,904

39,904% of 1,000399,040

As a fraction of 10039,904/100

Read another way

As seconds11 hours, 5 minutes and 4 seconds

As bytes38.969 KiB

As a 24-bit colour#009BE0

Keep nerding

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