Recognised as Number

39,468

Positive
Even
Composite
5 digits

39,468 is an even 5-digit integer and a composite number. It has 48 divisors and a digital root of 3.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value39,468

Digit count5

Digit sum30

Digit product5,184

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

Digital root3repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2^2 × 3 × 11 × 13 × 23

Distinct prime factors52, 3, 11, 13, 23

Number of divisors48

Sum of divisors σ(n)112,896

Aliquot sum73,428sum of the proper divisors

ClassificationAbundantthe aliquot sum exceeds the number

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

Carmichael function λ(n)660the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 10,560

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

SquarefreeNohas a repeated prime factor

All divisors1, 2, 3, 4, 6, 11, 12, 13, 22, 23, 26, 33, 39, 44, 46, 52, 66, 69, 78, 92, 132, 138, 143, 156, 253, 276, 286, 299, 429, 506, 572, 598, 759, 858, 897, 1,012, 1,196, 1,518, 1,716, 1,794, 3,036, 3,289, 3,588, 6,578, 9,867, 13,156, 19,734, 39,46848 in total

Arithmetic

Previous number39,467

Next number39,469

Double78,936

Half19,734

Square1,557,723,024

Cube61,480,212,311,232

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

Cube root34.047223883≈

Negation-39,468

Reciprocal0.000025337≈

Representations

Decimal39,468

Binary100110100010110016 bits

Octal115054

Hexadecimal9A2C

Base 36UGC

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

In wordsthirty-nine thousand, four hundred and sixty-eight

Ordinalthirty-nine thousand, four hundred and sixty-eighth

Scientific notation3.9468 × 10^4

Engineering notation39.468 × 10^3

In other bases

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

Quinary2230333base 5; one hand: 7 digits

Septenary223032base 7: 6 digits

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

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

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

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

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

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

Bit-level

1001101000101100

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 even

Highest set bitbit 15worth 32,768

Lowest set bitbit 22 trailing zeros

Power of twoNo

Bytes29a 2c

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

At each machine width

16-bit1001101000101100

32-bit00000000000000001001101000101100

64-bit0000000000000000000000000000000000000000000000001001101000101100

One's complement0110010111010011at 16 bits, every bit flipped

Bits reversed0011010001011001at 16 bits

Rotated left by 10011010001011001at 16 bits, wrapping

Shifted left by 110011010001011000= 78,936, no wrap

Shifted right by 1100110100010110= 19,734, discarding the low bit

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

Nearest landmarks

Next prime39,499+31

Previous prime39,461−7

Distance to nearest prime7

Nearest square below39,204

Nearest square above39,601

Powers & multiples

39,468 to the power 21,557,723,024

39,468 to the power 361,480,212,311,232

39,468 to the power 42,426,501,019,499,704,576

39,468 to the power 595,769,142,237,614,340,205,568

First ten multiples39,468, 78,936, 118,404, 157,872, 197,340, 236,808, 276,276, 315,744, 355,212, 394,680

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

Divisibility tests

Divisible by 2Yes

Divisible by 3Yes

Divisible by 4Yes

Divisible by 5No, remainder 3

Divisible by 6Yes

Divisible by 7No, remainder 2

Divisible by 8No, remainder 4

Divisible by 9No, remainder 3

Divisible by 10No, remainder 8

Divisible by 11Yes

Divisible by 12Yes

Divisible by 100No, remainder 68

Collatz (3n + 1) trajectory

Steps to reach 175the total stopping time

Highest value reached44,4041× the starting value

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

First steps39,468 → 19,734 → 9,867 → 29,602 → 14,801 → 44,404 → 22,202 → 11,101 → 33,304 → 16,652 → …

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

As a percentage & fraction

As a percentage3,946,800%

39,468% as a decimal394.68

39,468% of 10039,468

39,468% of 1,000394,680

As a fraction of 10039,468/100

Read another way

As seconds10 hours, 57 minutes and 48 seconds

As bytes38.543 KiB

As a 24-bit colour#009A2C

Keep nerding

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