Recognised as Number
3,289,594
- Positive
- Even
- Composite
- 7 digits
3,289,594 is an even 7-digit integer and a composite number. It has 32 divisors and a digital root of 4.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value3,289,594
Digit count7
Digit sum40
Digit product77,760
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2 × 7 × 11 × 41 × 521
Distinct prime factors52, 7, 11, 41, 521
Number of divisors32
Sum of divisors σ(n)6,314,112
Aliquot sum3,024,518sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,248,000integers below n that share no factor with it
Carmichael function λ(n)1,560the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,248,000
Möbius function μ(n)−15 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 7, 11, 14, 22, 41, 77, 82, 154, 287, 451, 521, 574, 902, 1,042, 3,157, 3,647, 5,731, 6,314, 7,294, 11,462, 21,361, 40,117, 42,722, 80,234, 149,527, 234,971, 299,054, 469,942, 1,644,797, 3,289,59432 in total
Arithmetic
Previous number3,289,593
Next number3,289,595
Double6,579,188
Half1,644,797
Square10,821,428,684,836
Cube35,598,106,873,064,396,584
Square root1,813.723793746≈irrational, shown to 9 decimal places
Cube root148.723900512≈
Negation-3,289,594
Reciprocal3.03988881 × 10^-7≈
Representations
Decimal3,289,594
Binary110010001100011111101022 bits
Octal14430772
Hexadecimal3231FA
Base 361YI9M
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, two hundred and eighty-nine thousand, five hundred and ninety-four
Ordinalthree million, two hundred and eighty-nine thousand, five hundred and ninety-fourth
Scientific notation3.289594 × 10^6
Engineering notation3.289594 × 10^6
In other bases
Ternary20012010110211base 3; the most digit-efficient integer base after e: 14 digits
Quinary1320231334base 5; one hand: 10 digits
Septenary36650440base 7: 8 digits
Nonary6163424base 9; each digit is two ternary digits: 7 digits
Duodecimal112784abase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal10b3jebase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal15:13:46:34base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T01TT010111T11digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101100111011000001110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001100100011000111111010
Bit length22 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits10within that length
Bit parityeven12 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
Bytes332 31 fa
Gray code1010110010100100000111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001100100011000111111010
64-bit0000000000000000000000000000000000000000001100100011000111111010
One's complement11111111110011011100111000000101at 32 bits, every bit flipped
Bits reversed01011111100011000100110000000000at 32 bits
Rotated left by 100000000011001000110001111110100at 32 bits, wrapping
Shifted left by 111001000110001111110100= 6,579,188, no wrap
Shifted right by 1110010001100011111101= 1,644,797, discarding the low bit
These bits as a double1.62527538 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,289,594 to the power 210,821,428,684,836
3,289,594 to the power 335,598,106,873,064,396,584
3,289,594 to the power 4117,103,318,780,991,400,616,346,896
3,289,594 to the power 5385,222,374,842,036,625,519,131,051,000,224
First ten multiples3,289,594, 6,579,188, 9,868,782, 13,158,376, 16,447,970, 19,737,564, 23,027,158, 26,316,752, 29,606,346, 32,895,940
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 4
Divisible by 6No, remainder 4
Divisible by 7Yes
Divisible by 8No, remainder 2
Divisible by 9No, remainder 4
Divisible by 10No, remainder 4
Divisible by 11Yes
Divisible by 12No, remainder 10
Divisible by 100No, remainder 94
Collatz (3n + 1) trajectory
Steps to reach 1115the total stopping time
Highest value reached9,367,6482× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,289,594 → 1,644,797 → 4,934,392 → 2,467,196 → 1,233,598 → 616,799 → 1,850,398 → 925,199 → 2,775,598 → 1,387,799 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage328,959,400%
3,289,594% as a decimal32,895.94
3,289,594% of 1003,289,594
3,289,594% of 1,00032,895,940
As a fraction of 1003,289,594/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,289,594
Nerdulate something else
Nothing in mind? Surprise me · today’s page