Nerdulator> put something in

Recognised as Number

3,301,670

  • Positive
  • Even
  • Composite
  • 7 digits

3,301,670 is an even 7-digit integer and a composite number. It has 8 divisors and a digital root of 2.

Number properties

ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value3,301,670
Digit count7
Digit sum20
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times 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 × 5 × 330,167
Distinct prime factors32, 5, 330,167
Number of divisors8
Sum of divisors σ(n)5,943,024
Aliquot sum2,641,354sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,320,664integers below n that share no factor with it
Carmichael function λ(n)660,332the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,320,664
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 5, 10, 330,167, 660,334, 1,650,835, 3,301,6708 in total

Arithmetic

Previous number3,301,669
Next number3,301,671
Double6,603,340
Cube35,991,586,514,767,463,000
Square root1,817.049806692≈irrational, shown to 9 decimal places
Cube root148.905665255≈
Negation-3,301,670
Reciprocal3.02877029 × 10^-7≈

Representations

Decimal3,301,670
Binary110010011000010010011022 bits
Octal14460446
Hexadecimal326126
Base 361YRL2
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, three hundred and one thousand, six hundred and seventy
Ordinalthree million, three hundred and one thousand, six hundred and seventieth
Scientific notation3.30167 × 10^6
Engineering notation3.30167 × 10^6

In other bases

Ternary20012202001002base 3; the most digit-efficient integer base after e: 14 digits
Quinary1321123140base 5; one hand: 10 digits
Septenary40030601base 7: 8 digits
Nonary6182032base 9; each digit is two ternary digits: 7 digits
Duodecimal1132832base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal10ce3abase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal15:17:7:50base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T01T0T1T00101Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101111010000101111010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000001100100110000100100110
Bit length22 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits13within that length
Bit parityodd9 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 61 26
Gray code1010110101000110110101n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000001100100110000100100110
64-bit0000000000000000000000000000000000000000001100100110000100100110
One's complement11111111110011011001111011011001at 32 bits, every bit flipped
Bits reversed01100100100001100100110000000000at 32 bits
Rotated left by 100000000011001001100001001001100at 32 bits, wrapping
Shifted left by 111001001100001001001100= 6,603,340, no wrap
Shifted right by 1110010011000010010011= 1,650,835, discarding the low bit
These bits as a double1.63124172 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime3,301,681+11
Previous prime3,301,663−7
Distance to nearest prime7
Nearest square below3,301,489
Nearest square above3,305,124

Powers & multiples

3,301,670 to the power 210,901,024,788,900
3,301,670 to the power 335,991,586,514,767,463,000
3,301,670 to the power 4118,832,341,448,212,289,563,210,000
3,301,670 to the power 5392,345,176,789,319,070,082,163,560,700,000
First ten multiples3,301,670, 6,603,340, 9,905,010, 13,206,680, 16,508,350, 19,810,020, 23,111,690, 26,413,360, 29,715,030, 33,016,700
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 4No, remainder 2
Divisible by 5Yes
Divisible by 6No, remainder 2
Divisible by 7No, remainder 1
Divisible by 8No, remainder 6
Divisible by 9No, remainder 2
Divisible by 10Yes
Divisible by 11No, remainder 9
Divisible by 12No, remainder 2
Divisible by 100No, remainder 70

Collatz (3n + 1) trajectory

Steps to reach 1146the total stopping time
Highest value reached7,932,9762× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,301,670 → 1,650,835 → 4,952,506 → 2,476,253 → 7,428,760 → 3,714,380 → 1,857,190 → 928,595 → 2,785,786 → 1,392,893 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage330,167,000%
3,301,670% as a decimal33,016.7
3,301,670% of 1003,301,670
3,301,670% of 1,00033,016,700
As a fraction of 1003,301,670/100

Read another way

As bytes3.149 MiB
As a 24-bit colour#326126

Keep nerding

Every link below is a page Nerdulator can generate from what it already knows about this value.

Nerdulate something else

Nothing in mind? Surprise me · today’s page

Every value on this page was computed from “3301670” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.