Recognised as Number
3,960,340
- Positive
- Even
- Composite
- 7 digits
3,960,340 is an even 7-digit integer and a composite number. It has 12 divisors and a digital root of 7.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value3,960,340
Digit count7
Digit sum25
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times 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 factorisation2^2 × 5 × 198,017
Distinct prime factors32, 5, 198,017
Number of divisors12
Sum of divisors σ(n)8,316,756
Aliquot sum4,356,416sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)1,584,128integers below n that share no factor with it
Carmichael function λ(n)198,016the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,584,128
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 5, 10, 20, 198,017, 396,034, 792,068, 990,085, 1,980,170, 3,960,34012 in total
Arithmetic
Previous number3,960,339
Next number3,960,341
Double7,920,680
Half1,980,170
Square15,684,292,915,600
Cube62,115,132,605,367,304,000
Square root1,990.060300594≈irrational, shown to 9 decimal places
Cube root158.213725612≈
Negation-3,960,340
Reciprocal2.52503573 × 10^-7≈
Representations
Decimal3,960,340
Binary111100011011100001010022 bits
Octal17067024
Hexadecimal3C6E14
Base 362CVTG
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, nine hundred and sixty thousand, three hundred and forty
Ordinalthree million, nine hundred and sixty thousand, three hundred and fortieth
Scientific notation3.96034 × 10^6
Engineering notation3.96034 × 10^6
In other bases
Ternary21110012120021base 3; the most digit-efficient integer base after e: 14 digits
Quinary2003212330base 5; one hand: 10 digits
Septenary45443116base 7: 8 digits
Nonary7405507base 9; each digit is two ternary digits: 7 digits
Duodecimal13aba44base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal14f0h0base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal18:20:5:40base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T11101T0TT01T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10011011011001000010100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001111000110111000010100
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 even
Highest set bitbit 21worth 2,097,152
Lowest set bitbit 22 trailing zeros
Power of twoNo
Bytes33c 6e 14
Gray code1000100101100100011110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001111000110111000010100
64-bit0000000000000000000000000000000000000000001111000110111000010100
One's complement11111111110000111001000111101011at 32 bits, every bit flipped
Bits reversed00101000011101100011110000000000at 32 bits
Rotated left by 100000000011110001101110000101000at 32 bits, wrapping
Shifted left by 111110001101110000101000= 7,920,680, no wrap
Shifted right by 1111100011011100001010= 1,980,170, discarding the low bit
These bits as a double1.95666794 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,960,340 to the power 215,684,292,915,600
3,960,340 to the power 362,115,132,605,367,304,000
3,960,340 to the power 4245,997,044,262,340,348,723,360,000
3,960,340 to the power 5974,231,934,273,916,976,663,071,542,400,000
First ten multiples3,960,340, 7,920,680, 11,881,020, 15,841,360, 19,801,700, 23,762,040, 27,722,380, 31,682,720, 35,643,060, 39,603,400
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 1
Divisible by 4Yes
Divisible by 5Yes
Divisible by 6No, remainder 4
Divisible by 7No, remainder 6
Divisible by 8No, remainder 4
Divisible by 9No, remainder 7
Divisible by 10Yes
Divisible by 11No, remainder 10
Divisible by 12No, remainder 4
Divisible by 100No, remainder 40
Collatz (3n + 1) trajectory
Steps to reach 192the total stopping time
Highest value reached3,960,340
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,960,340 → 1,980,170 → 990,085 → 2,970,256 → 1,485,128 → 742,564 → 371,282 → 185,641 → 556,924 → 278,462 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage396,034,000%
3,960,340% as a decimal39,603.4
3,960,340% of 1003,960,340
3,960,340% of 1,00039,603,400
As a fraction of 1003,960,340/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,960,340
Nerdulate something else
Nothing in mind? Surprise me · today’s page