Recognised as Number
3,994,292
- Positive
- Even
- Composite
- 7 digits
3,994,292 is an even 7-digit integer and a composite number. It has 24 divisors and a digital root of 2.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value3,994,292
Digit count7
Digit sum38
Digit product34,992
Multiplicative persistence5times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2^2 × 53 × 83 × 227
Distinct prime factors42, 53, 83, 227
Number of divisors24
Sum of divisors σ(n)7,239,456
Aliquot sum3,245,164sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,927,328integers below n that share no factor with it
Carmichael function λ(n)240,916the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,927,328
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 53, 83, 106, 166, 212, 227, 332, 454, 908, 4,399, 8,798, 12,031, 17,596, 18,841, 24,062, 37,682, 48,124, 75,364, 998,573, 1,997,146, 3,994,29224 in total
Arithmetic
Previous number3,994,291
Next number3,994,293
Double7,988,584
Half1,997,146
Square15,954,368,581,264
Cube63,726,406,789,194,145,088
Square root1,998.572490554≈irrational, shown to 9 decimal places
Cube root158.664561875≈
Negation-3,994,292
Reciprocal2.5035726 × 10^-7≈
Representations
Decimal3,994,292
Binary111100111100101011010022 bits
Octal17171264
Hexadecimal3CF2B4
Base 362DM0K
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, nine hundred and ninety-four thousand, two hundred and ninety-two
Ordinalthree million, nine hundred and ninety-four thousand, two hundred and ninety-second
Scientific notation3.994292 × 10^6
Engineering notation3.994292 × 10^6
In other bases
Ternary21111221010202base 3; the most digit-efficient integer base after e: 14 digits
Quinary2010304132base 5; one hand: 10 digits
Septenary45644111base 7: 8 digits
Nonary7457122base 9; each digit is two ternary digits: 7 digits
Duodecimal1407618base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal14j5ecbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal18:29:31:32base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10TTTT0T1011T1Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10011010011011111110100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001111001111001010110100
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 22 trailing zeros
Power of twoNo
Bytes33c f2 b4
Gray code1000101000101111101110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001111001111001010110100
64-bit0000000000000000000000000000000000000000001111001111001010110100
One's complement11111111110000110000110101001011at 32 bits, every bit flipped
Bits reversed00101101010011110011110000000000at 32 bits
Rotated left by 100000000011110011110010101101000at 32 bits, wrapping
Shifted left by 111110011110010101101000= 7,988,584, no wrap
Shifted right by 1111100111100101011010= 1,997,146, discarding the low bit
These bits as a double1.97344246 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,994,292 to the power 215,954,368,581,264
3,994,292 to the power 363,726,406,789,194,145,088
3,994,292 to the power 4254,541,876,826,823,860,171,837,696
3,994,292 to the power 51,016,714,582,274,367,930,093,489,934,431,232
First ten multiples3,994,292, 7,988,584, 11,982,876, 15,977,168, 19,971,460, 23,965,752, 27,960,044, 31,954,336, 35,948,628, 39,942,920
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 2
Divisible by 4Yes
Divisible by 5No, remainder 2
Divisible by 6No, remainder 2
Divisible by 7No, remainder 1
Divisible by 8No, remainder 4
Divisible by 9No, remainder 2
Divisible by 10No, remainder 2
Divisible by 11No, remainder 5
Divisible by 12No, remainder 8
Divisible by 100No, remainder 92
Collatz (3n + 1) trajectory
Steps to reach 1154the total stopping time
Highest value reached3,994,292
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,994,292 → 1,997,146 → 998,573 → 2,995,720 → 1,497,860 → 748,930 → 374,465 → 1,123,396 → 561,698 → 280,849 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage399,429,200%
3,994,292% as a decimal39,942.92
3,994,292% of 1003,994,292
3,994,292% of 1,00039,942,920
As a fraction of 1003,994,292/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,994,292
Nerdulate something else
Nothing in mind? Surprise me · today’s page