Recognised as Number
3,979,978
- Positive
- Even
- Composite
- 7 digits
3,979,978 is an even 7-digit integer and a composite number. It has 4 divisors and a digital root of 7.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value3,979,978
Digit count7
Digit sum52
Digit product857,304
Multiplicative persistence2times 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 × 1,989,989
Distinct prime factors22, 1,989,989
Number of divisors4
Sum of divisors σ(n)5,969,970
Aliquot sum1,989,992sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,989,988integers below n that share no factor with it
Carmichael function λ(n)1,989,988the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 1,989,989, 3,979,9784 in total
Arithmetic
Previous number3,979,977
Next number3,979,979
Double7,959,956
Half1,989,989
Square15,840,224,880,484
Cube63,043,746,539,378,949,352
Square root1,994.988220517≈irrational, shown to 9 decimal places
Cube root158.474804183≈
Negation-3,979,978
Reciprocal2.5125767 × 10^-7≈
Representations
Decimal3,979,978
Binary111100101110101100101022 bits
Octal17135312
Hexadecimal3CBACA
Base 362DAYY
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, nine hundred and seventy-nine thousand, nine hundred and seventy-eight
Ordinalthree million, nine hundred and seventy-nine thousand, nine hundred and seventy-eighth
Scientific notation3.979978 × 10^6
Engineering notation3.979978 × 10^6
In other bases
Ternary21111012111121base 3; the most digit-efficient integer base after e: 14 digits
Quinary2004324403base 5; one hand: 10 digits
Septenary45554302base 7: 8 digits
Nonary7435447base 9; each digit is two ternary digits: 7 digits
Duodecimal13bb28abase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal14h9iibase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal18:25:32:58base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T11111T0TTTTT1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10011011100111111011110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001111001011101011001010
Bit length22 bitsto write the magnitude
Set bits13the population count, or Hamming weight
Zero bits9within that length
Bit parityodd13 set bits, so odd; 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 ba ca
Gray code1000101110011110101111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001111001011101011001010
64-bit0000000000000000000000000000000000000000001111001011101011001010
One's complement11111111110000110100010100110101at 32 bits, every bit flipped
Bits reversed01010011010111010011110000000000at 32 bits
Rotated left by 100000000011110010111010110010100at 32 bits, wrapping
Shifted left by 111110010111010110010100= 7,959,956, no wrap
Shifted right by 1111100101110101100101= 1,989,989, discarding the low bit
These bits as a double1.9663704 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,979,978 to the power 215,840,224,880,484
3,979,978 to the power 363,043,746,539,378,949,352
3,979,978 to the power 4250,912,724,264,304,352,084,074,256
3,979,978 to the power 5998,627,122,491,997,506,598,869,689,246,368
First ten multiples3,979,978, 7,959,956, 11,939,934, 15,919,912, 19,899,890, 23,879,868, 27,859,846, 31,839,824, 35,819,802, 39,799,780
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 4No, remainder 2
Divisible by 5No, remainder 3
Divisible by 6No, remainder 4
Divisible by 7No, remainder 2
Divisible by 8No, remainder 2
Divisible by 9No, remainder 7
Divisible by 10No, remainder 8
Divisible by 11No, remainder 2
Divisible by 12No, remainder 10
Divisible by 100No, remainder 78
Collatz (3n + 1) trajectory
Steps to reach 1123the total stopping time
Highest value reached5,969,9681× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,979,978 → 1,989,989 → 5,969,968 → 2,984,984 → 1,492,492 → 746,246 → 373,123 → 1,119,370 → 559,685 → 1,679,056 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage397,997,800%
3,979,978% as a decimal39,799.78
3,979,978% of 1003,979,978
3,979,978% of 1,00039,799,780
As a fraction of 1003,979,978/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,979,978
Nerdulate something else
Nothing in mind? Surprise me · today’s page