Recognised as Number
3,320,146
- Positive
- Even
- Composite
- 7 digits
3,320,146 is an even 7-digit integer and a composite number. It has 4 divisors and a digital root of 1.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value3,320,146
Digit count7
Digit sum19
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times 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 × 1,660,073
Distinct prime factors22, 1,660,073
Number of divisors4
Sum of divisors σ(n)4,980,222
Aliquot sum1,660,076sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,660,072integers below n that share no factor with it
Carmichael function λ(n)1,660,072the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 1,660,073, 3,320,1464 in total
Arithmetic
Previous number3,320,145
Next number3,320,147
Double6,640,292
Half1,660,073
Square11,023,369,461,316
Cube36,599,196,023,510,472,136
Square root1,822.126779343≈irrational, shown to 9 decimal places
Cube root149.182905271≈
Negation-3,320,146
Reciprocal3.01191574 × 10^-7≈
Representations
Decimal3,320,146
Binary110010101010010101001022 bits
Octal14524522
Hexadecimal32A952
Base 361Z5UA
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, three hundred and twenty thousand, one hundred and forty-six
Ordinalthree million, three hundred and twenty thousand, one hundred and forty-sixth
Scientific notation3.320146 × 10^6
Engineering notation3.320146 × 10^6
In other bases
Ternary20020200101101base 3; the most digit-efficient integer base after e: 14 digits
Quinary1322221041base 5; one hand: 10 digits
Septenary40135504base 7: 8 digits
Nonary6220341base 9; each digit is two ternary digits: 7 digits
Duodecimal114146abase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal10f076base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal15:22:15:46base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T01T1T00101101digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101111111100101010110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001100101010100101010010
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 even
Highest set bitbit 21worth 2,097,152
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes332 a9 52
Gray code1010111111110111111011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001100101010100101010010
64-bit0000000000000000000000000000000000000000001100101010100101010010
One's complement11111111110011010101011010101101at 32 bits, every bit flipped
Bits reversed01001010100101010100110000000000at 32 bits
Rotated left by 100000000011001010101001010100100at 32 bits, wrapping
Shifted left by 111001010101001010100100= 6,640,292, no wrap
Shifted right by 1110010101010010101001= 1,660,073, discarding the low bit
These bits as a double1.64037008 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,320,146 to the power 211,023,369,461,316
3,320,146 to the power 336,599,196,023,510,472,136
3,320,146 to the power 4121,514,674,280,674,200,020,451,856
3,320,146 to the power 5403,446,459,754,283,322,501,103,147,890,976
First ten multiples3,320,146, 6,640,292, 9,960,438, 13,280,584, 16,600,730, 19,920,876, 23,241,022, 26,561,168, 29,881,314, 33,201,460
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 1
Divisible by 6No, remainder 4
Divisible by 7No, remainder 4
Divisible by 8No, remainder 2
Divisible by 9No, remainder 1
Divisible by 10No, remainder 6
Divisible by 11No, remainder 5
Divisible by 12No, remainder 10
Divisible by 100No, remainder 46
Collatz (3n + 1) trajectory
Steps to reach 1138the total stopping time
Highest value reached42,545,89612× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,320,146 → 1,660,073 → 4,980,220 → 2,490,110 → 1,245,055 → 3,735,166 → 1,867,583 → 5,602,750 → 2,801,375 → 8,404,126 → …
Last steps… → 32 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage332,014,600%
3,320,146% as a decimal33,201.46
3,320,146% of 1003,320,146
3,320,146% of 1,00033,201,460
As a fraction of 1003,320,146/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,320,146
Nerdulate something else
Nothing in mind? Surprise me · today’s page