Recognised as Number
3,990,498
- Positive
- Even
- Composite
- 7 digits
3,990,498 is an even 7-digit integer and a composite number. It has 16 divisors and a digital root of 6.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value3,990,498
Digit count7
Digit sum42
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root6repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2 × 3 × 61 × 10,903
Distinct prime factors42, 3, 61, 10,903
Number of divisors16
Sum of divisors σ(n)8,112,576
Aliquot sum4,122,078sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)1,308,240integers below n that share no factor with it
Carmichael function λ(n)109,020the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,308,240
Möbius function μ(n)+14 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 3, 6, 61, 122, 183, 366, 10,903, 21,806, 32,709, 65,418, 665,083, 1,330,166, 1,995,249, 3,990,49816 in total
Arithmetic
Previous number3,990,497
Next number3,990,499
Double7,980,996
Half1,995,249
Square15,924,074,288,004
Cube63,544,986,598,131,385,992
Square root1,997.623087572≈irrational, shown to 9 decimal places
Cube root158.614309829≈
Negation-3,990,498
Reciprocal2.50595289 × 10^-7≈
Representations
Decimal3,990,498
Binary111100111000111110001022 bits
Octal17161742
Hexadecimal3CE3E2
Base 362DJ36
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, nine hundred and ninety thousand, four hundred and ninety-eight
Ordinalthree million, nine hundred and ninety thousand, four hundred and ninety-eighth
Scientific notation3.990498 × 10^6
Engineering notation3.990498 × 10^6
In other bases
Ternary21111201221020base 3; the most digit-efficient integer base after e: 14 digits
Quinary2010143443base 5; one hand: 10 digits
Septenary45630051base 7: 8 digits
Nonary7451836base 9; each digit is two ternary digits: 7 digits
Duodecimal1405396base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal14ig4ibase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal18:28:28:18base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10TTTTT1T0T11T0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10011010010010000100110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001111001110001111100010
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 e3 e2
Gray code1000101001001000010011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001111001110001111100010
64-bit0000000000000000000000000000000000000000001111001110001111100010
One's complement11111111110000110001110000011101at 32 bits, every bit flipped
Bits reversed01000111110001110011110000000000at 32 bits
Rotated left by 100000000011110011100011111000100at 32 bits, wrapping
Shifted left by 111110011100011111000100= 7,980,996, no wrap
Shifted right by 1111100111000111110001= 1,995,249, discarding the low bit
These bits as a double1.97156797 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,990,498 to the power 215,924,074,288,004
3,990,498 to the power 363,544,986,598,131,385,992
3,990,498 to the power 4253,576,141,929,870,099,538,304,016
3,990,498 to the power 51,011,895,087,218,862,772,467,403,099,239,968
First ten multiples3,990,498, 7,980,996, 11,971,494, 15,961,992, 19,952,490, 23,942,988, 27,933,486, 31,923,984, 35,914,482, 39,904,980
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 5No, remainder 3
Divisible by 6Yes
Divisible by 7No, remainder 1
Divisible by 8No, remainder 2
Divisible by 9No, remainder 6
Divisible by 10No, remainder 8
Divisible by 11No, remainder 6
Divisible by 12No, remainder 6
Divisible by 100No, remainder 98
Collatz (3n + 1) trajectory
Steps to reach 192the total stopping time
Highest value reached5,985,7481× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,990,498 → 1,995,249 → 5,985,748 → 2,992,874 → 1,496,437 → 4,489,312 → 2,244,656 → 1,122,328 → 561,164 → 280,582 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage399,049,800%
3,990,498% as a decimal39,904.98
3,990,498% of 1003,990,498
3,990,498% of 1,00039,904,980
As a fraction of 1003,990,498/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,990,498
Nerdulate something else
Nothing in mind? Surprise me · today’s page