Recognised as Number
3,321,262
- Positive
- Even
- Composite
- 7 digits
3,321,262 is an even 7-digit integer and a composite number. It has 8 divisors and a digital root of 1.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value3,321,262
Digit count7
Digit sum19
Digit product432
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2 × 7 × 237,233
Distinct prime factors32, 7, 237,233
Number of divisors8
Sum of divisors σ(n)5,693,616
Aliquot sum2,372,354sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,423,392integers below n that share no factor with it
Carmichael function λ(n)711,696the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,423,392
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 7, 14, 237,233, 474,466, 1,660,631, 3,321,2628 in total
Arithmetic
Previous number3,321,261
Next number3,321,263
Double6,642,524
Half1,660,631
Square11,030,781,272,644
Cube36,636,114,671,144,156,728
Square root1,822.432989166≈irrational, shown to 9 decimal places
Cube root149.199618339≈
Negation-3,321,262
Reciprocal3.01090369 × 10^-7≈
Representations
Decimal3,321,262
Binary110010101011011010111022 bits
Octal14526656
Hexadecimal32ADAE
Base 361Z6PA
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, three hundred and twenty-one thousand, two hundred and sixty-two
Ordinalthree million, three hundred and twenty-one thousand, two hundred and sixty-second
Scientific notation3.321262 × 10^6
Engineering notation3.321262 × 10^6
In other bases
Ternary20020201220201base 3; the most digit-efficient integer base after e: 14 digits
Quinary1322240022base 5; one hand: 10 digits
Septenary40141660base 7: 8 digits
Nonary6221821base 9; each digit is two ternary digits: 7 digits
Duodecimal114203abase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal10f332base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal15:22:34:22base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T01T1T1T0T1T01digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101111111001011110010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001100101010110110101110
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
Bytes332 ad ae
Gray code1010111111101101111001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001100101010110110101110
64-bit0000000000000000000000000000000000000000001100101010110110101110
One's complement11111111110011010101001001010001at 32 bits, every bit flipped
Bits reversed01110101101101010100110000000000at 32 bits
Rotated left by 100000000011001010101101101011100at 32 bits, wrapping
Shifted left by 111001010101101101011100= 6,642,524, no wrap
Shifted right by 1110010101011011010111= 1,660,631, discarding the low bit
These bits as a double1.64092146 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,321,262 to the power 211,030,781,272,644
3,321,262 to the power 336,636,114,671,144,156,728
3,321,262 to the power 4121,678,135,484,913,584,262,750,736
3,321,262 to the power 5404,124,967,616,895,060,695,672,034,948,832
First ten multiples3,321,262, 6,642,524, 9,963,786, 13,285,048, 16,606,310, 19,927,572, 23,248,834, 26,570,096, 29,891,358, 33,212,620
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 2
Divisible by 6No, remainder 4
Divisible by 7Yes
Divisible by 8No, remainder 6
Divisible by 9No, remainder 1
Divisible by 10No, remainder 2
Divisible by 11No, remainder 10
Divisible by 12No, remainder 10
Divisible by 100No, remainder 62
Collatz (3n + 1) trajectory
Steps to reach 1102the total stopping time
Highest value reached11,209,2643× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,321,262 → 1,660,631 → 4,981,894 → 2,490,947 → 7,472,842 → 3,736,421 → 11,209,264 → 5,604,632 → 2,802,316 → 1,401,158 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage332,126,200%
3,321,262% as a decimal33,212.62
3,321,262% of 1003,321,262
3,321,262% of 1,00033,212,620
As a fraction of 1003,321,262/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,321,262
Nerdulate something else
Nothing in mind? Surprise me · today’s page