Recognised as Number
3,972,990
- Positive
- Even
- Composite
- 7 digits
3,972,990 is an even 7-digit integer and a composite number. It has 32 divisors and a digital root of 3.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value3,972,990
Digit count7
Digit sum39
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 × 5 × 7 × 18,919
Distinct prime factors52, 3, 5, 7, 18,919
Number of divisors32
Sum of divisors σ(n)10,897,920
Aliquot sum6,924,930sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)908,064integers below n that share no factor with it
Carmichael function λ(n)37,836the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 908,064
Möbius function μ(n)−15 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 3, 5, 6, 7, 10, 14, 15, 21, 30, 35, 42, 70, 105, 210, 18,919, 37,838, 56,757, 94,595, 113,514, 132,433, 189,190, 264,866, 283,785, 397,299, 567,570, 662,165, 794,598, 1,324,330, 1,986,495, 3,972,99032 in total
Arithmetic
Previous number3,972,989
Next number3,972,991
Double7,945,980
Half1,986,495
Square15,784,649,540,100
Cube62,712,254,776,321,899,000
Square root1,993.236062287≈irrational, shown to 9 decimal places
Cube root158.382000429≈
Negation-3,972,990
Reciprocal2.51699602 × 10^-7≈
Representations
Decimal3,972,990
Binary111100100111110111111022 bits
Octal17117576
Hexadecimal3C9F7E
Base 362D5KU
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, nine hundred and seventy-two thousand, nine hundred and ninety
Ordinalthree million, nine hundred and seventy-two thousand, nine hundred and ninetieth
Scientific notation3.97299 × 10^6
Engineering notation3.97299 × 10^6
In other bases
Ternary21110211220210base 3; the most digit-efficient integer base after e: 14 digits
Quinary2004113430base 5; one hand: 10 digits
Septenary45525030base 7: 8 digits
Nonary7424823base 9; each digit is two ternary digits: 7 digits
Duodecimal13b7226base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal14gc9abase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal18:23:36:30base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T11110TT0T1T10digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10011011110000010000010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001111001001111101111110
Bit length22 bitsto write the magnitude
Set bits16the population count, or Hamming weight
Zero bits6within that length
Bit parityeven16 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 9f 7e
Gray code1000101101000011000001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001111001001111101111110
64-bit0000000000000000000000000000000000000000001111001001111101111110
One's complement11111111110000110110000010000001at 32 bits, every bit flipped
Bits reversed01111110111110010011110000000000at 32 bits
Rotated left by 100000000011110010011111011111100at 32 bits, wrapping
Shifted left by 111110010011111011111100= 7,945,980, no wrap
Shifted right by 1111100100111110111111= 1,986,495, discarding the low bit
These bits as a double1.96291787 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,972,990 to the power 215,784,649,540,100
3,972,990 to the power 362,712,254,776,321,899,000
3,972,990 to the power 4249,155,161,103,779,141,508,010,000
3,972,990 to the power 5989,890,963,513,703,491,419,908,649,900,000
First ten multiples3,972,990, 7,945,980, 11,918,970, 15,891,960, 19,864,950, 23,837,940, 27,810,930, 31,783,920, 35,756,910, 39,729,900
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 5Yes
Divisible by 6Yes
Divisible by 7Yes
Divisible by 8No, remainder 6
Divisible by 9No, remainder 3
Divisible by 10Yes
Divisible by 11No, remainder 10
Divisible by 12No, remainder 6
Divisible by 100No, remainder 90
Collatz (3n + 1) trajectory
Steps to reach 1185the total stopping time
Highest value reached50,911,72012× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,972,990 → 1,986,495 → 5,959,486 → 2,979,743 → 8,939,230 → 4,469,615 → 13,408,846 → 6,704,423 → 20,113,270 → 10,056,635 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage397,299,000%
3,972,990% as a decimal39,729.9
3,972,990% of 1003,972,990
3,972,990% of 1,00039,729,900
As a fraction of 1003,972,990/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,972,990
Nerdulate something else
Nothing in mind? Surprise me · today’s page