Recognised as Number

3,983,106

Positive
Even
Composite
7 digits

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

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value3,983,106

Digit count7

Digit sum30

Digit product0zero, because one of the digits is zero

Multiplicative persistence1times 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 × 3 × 89 × 7,459

Distinct prime factors42, 3, 89, 7,459

Number of divisors16

Sum of divisors σ(n)8,056,800

Aliquot sum4,073,694sum of the proper divisors

ClassificationAbundantthe aliquot sum exceeds the number

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

Carmichael function λ(n)29,832the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,312,608

Möbius function μ(n)+14 distinct prime factors, an even number of them

SquarefreeYesno repeated prime factor

All divisors1, 2, 3, 6, 89, 178, 267, 534, 7,459, 14,918, 22,377, 44,754, 663,851, 1,327,702, 1,991,553, 3,983,10616 in total

Arithmetic

Previous number3,983,105

Next number3,983,107

Double7,966,212

Half1,991,553

Square15,865,133,407,236

Cube63,192,508,065,162,155,016

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

Cube root158.516310223≈

Negation-3,983,106

Reciprocal2.51060353 × 10^-7≈

Representations

Decimal3,983,106

Binary111100110001110000001022 bits

Octal17143402

Hexadecimal3CC702

Base 362DDDU

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

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

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

Scientific notation3.983106 × 10^6

Engineering notation3.983106 × 10^6

In other bases

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

Quinary2004424411base 5; one hand: 10 digits

Septenary45566361base 7: 8 digits

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

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

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

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

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

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

Bit-level

00000000001111001100011100000010

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 11 trailing zero

Power of twoNo

Bytes33c c7 02

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

At each machine width

32-bit00000000001111001100011100000010

64-bit0000000000000000000000000000000000000000001111001100011100000010

One's complement11111111110000110011100011111101at 32 bits, every bit flipped

Bits reversed01000000111000110011110000000000at 32 bits

Rotated left by 100000000011110011000111000000100at 32 bits, wrapping

Shifted left by 111110011000111000000100= 7,966,212, no wrap

Shifted right by 1111100110001110000001= 1,991,553, discarding the low bit

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

Nearest landmarks

Next prime3,983,123+17

Previous prime3,983,093−13

Distance to nearest prime13

Nearest square below3,980,025

Nearest square above3,984,016

Powers & multiples

3,983,106 to the power 215,865,133,407,236

3,983,106 to the power 363,192,508,065,162,155,016

3,983,106 to the power 4251,702,458,029,395,770,617,159,696

3,983,106 to the power 51,002,557,570,791,634,470,319,832,488,095,776

First ten multiples3,983,106, 7,966,212, 11,949,318, 15,932,424, 19,915,530, 23,898,636, 27,881,742, 31,864,848, 35,847,954, 39,831,060

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

Divisibility tests

Divisible by 2Yes

Divisible by 3Yes

Divisible by 4No, remainder 2

Divisible by 5No, remainder 1

Divisible by 6Yes

Divisible by 7No, remainder 1

Divisible by 8No, remainder 2

Divisible by 9No, remainder 3

Divisible by 10No, remainder 6

Divisible by 11No, remainder 6

Divisible by 12No, remainder 6

Divisible by 100No, remainder 6

Collatz (3n + 1) trajectory

Steps to reach 1185the total stopping time

Highest value reached6,813,2321× the starting value

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

First steps3,983,106 → 1,991,553 → 5,974,660 → 2,987,330 → 1,493,665 → 4,480,996 → 2,240,498 → 1,120,249 → 3,360,748 → 1,680,374 → …

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

As a percentage & fraction

As a percentage398,310,600%

3,983,106% as a decimal39,831.06

3,983,106% of 1003,983,106

3,983,106% of 1,00039,831,060

As a fraction of 1003,983,106/100

Read another way

As seconds46 days, 2 hours and 25 minutes

As bytes3.799 MiB

As a 24-bit colour#3CC702

Keep nerding

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