Recognised as Number
3,288,121
- Positive
- Odd
- Composite
- 7 digits
3,288,121 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,288,121
Digit count7
Digit sum25
Digit product768
Multiplicative persistence5times 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 factorisation19 × 173,059
Distinct prime factors219, 173,059
Number of divisors4
Sum of divisors σ(n)3,461,200
Aliquot sum173,079sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,115,044integers below n that share no factor with it
Carmichael function λ(n)519,174the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 3,115,044
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 19, 173,059, 3,288,1214 in total
Arithmetic
Previous number3,288,120
Next number3,288,122
Double6,576,242
Half1,644,060.5
Square10,811,739,710,641
Cube35,550,308,389,092,595,561
Square root1,813.317677628≈irrational, shown to 9 decimal places
Cube root148.701698886≈
Negation-3,288,121
Reciprocal3.04125061 × 10^-7≈
Representations
Decimal3,288,121
Binary110010001011000011100122 bits
Octal14426071
Hexadecimal322C39
Base 361YH4P
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, two hundred and eighty-eight thousand, one hundred and twenty-one
Ordinalthree million, two hundred and eighty-eight thousand, one hundred and twenty-first
Scientific notation3.288121 × 10^6
Engineering notation3.288121 × 10^6
In other bases
Ternary20012001110021base 3; the most digit-efficient integer base after e: 14 digits
Quinary1320204441base 5; one hand: 10 digits
Septenary36643234base 7: 8 digits
Nonary6161407base 9; each digit is two ternary digits: 7 digits
Duodecimal1126a21base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal10b061base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal15:13:22:1base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T01TT0011101T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101100111110001001001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001100100010110000111001
Bit length22 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits12within that length
Bit parityeven10 set bits, so even; not the same as the number itself being odd
Highest set bitbit 21worth 2,097,152
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes332 2c 39
Gray code1010110011101000100101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001100100010110000111001
64-bit0000000000000000000000000000000000000000001100100010110000111001
One's complement11111111110011011101001111000110at 32 bits, every bit flipped
Bits reversed10011100001101000100110000000000at 32 bits
Rotated left by 100000000011001000101100001110010at 32 bits, wrapping
Shifted left by 111001000101100001110010= 6,576,242, no wrap
Shifted right by 1110010001011000011100= 1,644,060, discarding the low bit
These bits as a double1.62454763 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,288,121 to the power 210,811,739,710,641
3,288,121 to the power 335,550,308,389,092,595,561
3,288,121 to the power 4116,893,715,570,651,534,408,630,881
3,288,121 to the power 5384,360,680,935,886,293,971,241,781,064,601
First ten multiples3,288,121, 6,576,242, 9,864,363, 13,152,484, 16,440,605, 19,728,726, 23,016,847, 26,304,968, 29,593,089, 32,881,210
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 1
Divisible by 7No, remainder 4
Divisible by 8No, remainder 1
Divisible by 9No, remainder 7
Divisible by 10No, remainder 1
Divisible by 11No, remainder 1
Divisible by 12No, remainder 1
Divisible by 100No, remainder 21
Collatz (3n + 1) trajectory
Steps to reach 1314the total stopping time
Highest value reached227,788,90069× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,288,121 → 9,864,364 → 4,932,182 → 2,466,091 → 7,398,274 → 3,699,137 → 11,097,412 → 5,548,706 → 2,774,353 → 8,323,060 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage328,812,100%
3,288,121% as a decimal32,881.21
3,288,121% of 1003,288,121
3,288,121% of 1,00032,881,210
As a fraction of 1003,288,121/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,288,121
Nerdulate something else
Nothing in mind? Surprise me · today’s page