Recognised as Number
3,876,613
- Positive
- Odd
- Composite
- 7 digits
3,876,613 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,876,613
Digit count7
Digit sum34
Digit product18,144
Multiplicative persistence4times 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 factorisation13 × 298,201
Distinct prime factors213, 298,201
Number of divisors4
Sum of divisors σ(n)4,174,828
Aliquot sum298,215sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,578,400integers below n that share no factor with it
Carmichael function λ(n)298,200the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 3,578,400
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 13, 298,201, 3,876,6134 in total
Arithmetic
Previous number3,876,612
Next number3,876,614
Double7,753,226
Half1,938,306.5
Square15,028,128,351,769
Cube58,258,237,734,136,278,397
Square root1,968.911628286≈irrational, shown to 9 decimal places
Cube root157.090823347≈
Negation-3,876,613
Reciprocal2.57957139 × 10^-7≈
Representations
Decimal3,876,613
Binary111011001001110000010122 bits
Octal16623405
Hexadecimal3B2705
Base 362B37P
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, eight hundred and seventy-six thousand, six hundred and thirteen
Ordinalthree million, eight hundred and seventy-six thousand, six hundred and thirteenth
Scientific notation3.876613 × 10^6
Engineering notation3.876613 × 10^6
In other bases
Ternary21021221201021base 3; the most digit-efficient integer base after e: 14 digits
Quinary1443022423base 5; one hand: 10 digits
Septenary44644036base 7: 8 digits
Nonary7257637base 9; each digit is two ternary digits: 7 digits
Duodecimal136b4b1base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal144badbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal17:56:50:13base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T110T00TT011T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10011110111101100000101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001110110010011100000101
Bit length22 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits11within that length
Bit parityodd11 set bits, so odd; 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 27 05
Gray code1001101011010010000111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001110110010011100000101
64-bit0000000000000000000000000000000000000000001110110010011100000101
One's complement11111111110001001101100011111010at 32 bits, every bit flipped
Bits reversed10100000111001001101110000000000at 32 bits
Rotated left by 100000000011101100100111000001010at 32 bits, wrapping
Shifted left by 111101100100111000001010= 7,753,226, no wrap
Shifted right by 1111011001001110000010= 1,938,306, discarding the low bit
These bits as a double1.91530131 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,876,613 to the power 215,028,128,351,769
3,876,613 to the power 358,258,237,734,136,278,397
3,876,613 to the power 4225,844,641,757,243,240,605,429,361
3,876,613 to the power 5875,512,274,216,471,990,693,135,331,434,293
First ten multiples3,876,613, 7,753,226, 11,629,839, 15,506,452, 19,383,065, 23,259,678, 27,136,291, 31,012,904, 34,889,517, 38,766,130
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 3
Divisible by 6No, remainder 1
Divisible by 7No, remainder 6
Divisible by 8No, remainder 5
Divisible by 9No, remainder 7
Divisible by 10No, remainder 3
Divisible by 11No, remainder 4
Divisible by 12No, remainder 1
Divisible by 100No, remainder 13
Collatz (3n + 1) trajectory
Steps to reach 1216the total stopping time
Highest value reached11,629,8403× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,876,613 → 11,629,840 → 5,814,920 → 2,907,460 → 1,453,730 → 726,865 → 2,180,596 → 1,090,298 → 545,149 → 1,635,448 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage387,661,300%
3,876,613% as a decimal38,766.13
3,876,613% of 1003,876,613
3,876,613% of 1,00038,766,130
As a fraction of 1003,876,613/100
Read another way
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from 3,876,613
Nerdulate something else
Nothing in mind? Surprise me · today’s page