Recognised as Number

3,983,108

Positive
Even
Composite
7 digits

3,983,108 is an even 7-digit integer and a composite number. It has 12 divisors and a digital root of 5.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value3,983,108

Digit count7

Digit sum32

Digit product0zero, because one of the digits is zero

Multiplicative persistence1times 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 factorisation2^2 × 179 × 5,563

Distinct prime factors32, 179, 5,563

Number of divisors12

Sum of divisors σ(n)7,010,640

Aliquot sum3,027,532sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)1,980,072integers below n that share no factor with it

Carmichael function λ(n)495,018the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,980,072

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

SquarefreeNohas a repeated prime factor

All divisors1, 2, 4, 179, 358, 716, 5,563, 11,126, 22,252, 995,777, 1,991,554, 3,983,10812 in total

Arithmetic

Previous number3,983,107

Next number3,983,109

Double7,966,216

Half1,991,554

Square15,865,149,339,664

Cube63,192,603,256,010,395,712

Square root1,995.772532129≈irrational, shown to 9 decimal places

Cube root158.516336754≈

Negation-3,983,108

Reciprocal2.51060227 × 10^-7≈

Representations

Decimal3,983,108

Binary111100110001110000010022 bits

Octal17143404

Hexadecimal3CC704

Base 362DDDW

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

In wordsthree million, nine hundred and eighty-three thousand, one hundred and eight

Ordinalthree million, nine hundred and eighty-three thousand, one hundred and eighth

Scientific notation3.983108 × 10^6

Engineering notation3.983108 × 10^6

In other bases

Ternary21111100210112base 3; the most digit-efficient integer base after e: 14 digits

Quinary2004424413base 5; one hand: 10 digits

Septenary45566363base 7: 8 digits

Nonary7440715base 9; each digit is two ternary digits: 7 digits

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

Vigesimal14hhf8base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits

Sexagesimal18:26:25:8base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000001111001100011100000100

Bit length22 bitsto write the magnitude

Set bits10the population count, or Hamming weight

Zero bits12within that length

Bit parityeven10 set bits, so even; not the same as the number itself being even

Highest set bitbit 21worth 2,097,152

Lowest set bitbit 22 trailing zeros

Power of twoNo

Bytes33c c7 04

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

At each machine width

32-bit00000000001111001100011100000100

64-bit0000000000000000000000000000000000000000001111001100011100000100

One's complement11111111110000110011100011111011at 32 bits, every bit flipped

Bits reversed00100000111000110011110000000000at 32 bits

Rotated left by 100000000011110011000111000001000at 32 bits, wrapping

Shifted left by 111110011000111000001000= 7,966,216, no wrap

Shifted right by 1111100110001110000010= 1,991,554, discarding the low bit

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

Nearest landmarks

Next prime3,983,123+15

Previous prime3,983,093−15

Distance to nearest prime15

Nearest square below3,980,025

Nearest square above3,984,016

Powers & multiples

3,983,108 to the power 215,865,149,339,664

3,983,108 to the power 363,192,603,256,010,395,712

3,983,108 to the power 4251,702,963,569,841,055,243,632,896

3,983,108 to the power 51,002,560,087,818,742,465,869,356,137,120,768

First ten multiples3,983,108, 7,966,216, 11,949,324, 15,932,432, 19,915,540, 23,898,648, 27,881,756, 31,864,864, 35,847,972, 39,831,080

Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)

Divisibility tests

Divisible by 2Yes

Divisible by 3No, remainder 2

Divisible by 4Yes

Divisible by 5No, remainder 3

Divisible by 6No, remainder 2

Divisible by 7No, remainder 3

Divisible by 8No, remainder 4

Divisible by 9No, remainder 5

Divisible by 10No, remainder 8

Divisible by 11No, remainder 8

Divisible by 12No, remainder 8

Divisible by 100No, remainder 8

Collatz (3n + 1) trajectory

Steps to reach 1185the total stopping time

Highest value reached7,177,7321× the starting value

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

First steps3,983,108 → 1,991,554 → 995,777 → 2,987,332 → 1,493,666 → 746,833 → 2,240,500 → 1,120,250 → 560,125 → 1,680,376 → …

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

As a percentage & fraction

As a percentage398,310,800%

3,983,108% as a decimal39,831.08

3,983,108% of 1003,983,108

3,983,108% of 1,00039,831,080

As a fraction of 1003,983,108/100

Read another way

As seconds46 days, 2 hours and 25 minutes

As bytes3.799 MiB

As a 24-bit colour#3CC704

Keep nerding

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