Recognised as Number

3,876,961

Positive
Odd
Composite
Perfect square
7 digits

3,876,961 is an odd 7-digit integer and a composite number. It has 9 divisors and a digital root of 4.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value3,876,961

Digit count7

Digit sum40

Digit product54,432

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

Digital root4repeated digit sum

PalindromicNoreads differently backwards

Perfect squareYes, 1,969²

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation11^2 × 179^2

Distinct prime factors211, 179

Number of divisors9

Sum of divisors σ(n)4,285,393

Aliquot sum408,432sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)3,504,820integers below n that share no factor with it

Carmichael function λ(n)1,752,410the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 3,504,820

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

SquarefreeNohas a repeated prime factor

All divisors1, 11, 121, 179, 1,969, 21,659, 32,041, 352,451, 3,876,9619 in total

Arithmetic

Previous number3,876,960

Next number3,876,962

Double7,753,922

Half1,938,480.5

Square15,030,826,595,521

Cube58,273,928,508,597,691,681

Square root1,969exact

Cube root157.095523839≈

Negation-3,876,961

Reciprocal2.57933985 × 10^-7≈

Representations

Decimal3,876,961

Binary111011001010000110000122 bits

Octal16624141

Hexadecimal3B2861

Base 362B3HD

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

In wordsthree million, eight hundred and seventy-six thousand, nine hundred and sixty-one

Ordinalthree million, eight hundred and seventy-six thousand, nine hundred and sixty-first

Scientific notation3.876961 × 10^6

Engineering notation3.876961 × 10^6

In other bases

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

Quinary1443030321base 5; one hand: 10 digits

Septenary44645044base 7: 8 digits

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

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

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

Sexagesimal17:56:56:1base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000001110110010100001100001

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 odd

Highest set bitbit 21worth 2,097,152

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes33b 28 61

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

At each machine width

32-bit00000000001110110010100001100001

64-bit0000000000000000000000000000000000000000001110110010100001100001

One's complement11111111110001001101011110011110at 32 bits, every bit flipped

Bits reversed10000110000101001101110000000000at 32 bits

Rotated left by 100000000011101100101000011000010at 32 bits, wrapping

Shifted left by 111101100101000011000010= 7,753,922, no wrap

Shifted right by 1111011001010000110000= 1,938,480, discarding the low bit

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

Nearest landmarks

Next prime3,876,973+12

Previous prime3,876,959−2

Distance to nearest prime2

Nearest square below3,876,961

Nearest square above3,880,900

Powers & multiples

3,876,961 to the power 215,030,826,595,521

3,876,961 to the power 358,273,928,508,597,691,681

3,876,961 to the power 4225,925,748,144,621,415,337,261,441

3,876,961 to the power 5875,905,314,452,519,587,027,364,453,560,801

First ten multiples3,876,961, 7,753,922, 11,630,883, 15,507,844, 19,384,805, 23,261,766, 27,138,727, 31,015,688, 34,892,649, 38,769,610

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

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 1

Divisible by 4No, remainder 1

Divisible by 5No, remainder 1

Divisible by 6No, remainder 1

Divisible by 7No, remainder 4

Divisible by 8No, remainder 1

Divisible by 9No, remainder 4

Divisible by 10No, remainder 1

Divisible by 11Yes

Divisible by 12No, remainder 1

Divisible by 100No, remainder 61

Collatz (3n + 1) trajectory

Steps to reach 1110the total stopping time

Highest value reached14,720,3443× the starting value

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

First steps3,876,961 → 11,630,884 → 5,815,442 → 2,907,721 → 8,723,164 → 4,361,582 → 2,180,791 → 6,542,374 → 3,271,187 → 9,813,562 → …

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

As a percentage & fraction

As a percentage387,696,100%

3,876,961% as a decimal38,769.61

3,876,961% of 1003,876,961

3,876,961% of 1,00038,769,610

As a fraction of 1003,876,961/100

Read another way

As seconds44 days, 20 hours and 56 minutes

As bytes3.697 MiB

As a 24-bit colour#3B2861

Keep nerding

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