Recognised as Number
3,309,366
- Positive
- Even
- Composite
- 7 digits
3,309,366 is an even 7-digit integer and a composite number. It has 32 divisors and a digital root of 3.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value3,309,366
Digit count7
Digit sum30
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root3repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2 × 3 × 43 × 101 × 127
Distinct prime factors52, 3, 43, 101, 127
Number of divisors32
Sum of divisors σ(n)6,893,568
Aliquot sum3,584,202sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)1,058,400integers below n that share no factor with it
Carmichael function λ(n)6,300the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,058,400
Möbius function μ(n)−15 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 3, 6, 43, 86, 101, 127, 129, 202, 254, 258, 303, 381, 606, 762, 4,343, 5,461, 8,686, 10,922, 12,827, 13,029, 16,383, 25,654, 26,058, 32,766, 38,481, 76,962, 551,561, 1,103,122, 1,654,683, 3,309,36632 in total
Arithmetic
Previous number3,309,365
Next number3,309,367
Double6,618,732
Half1,654,683
Square10,951,903,321,956
Cube36,243,856,488,968,239,896
Square root1,819.166292564≈irrational, shown to 9 decimal places
Cube root149.021272281≈
Negation-3,309,366
Reciprocal3.02172682 × 10^-7≈
Representations
Decimal3,309,366
Binary110010011111110011011022 bits
Octal14477466
Hexadecimal327F36
Base 361YXIU
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, three hundred and nine thousand, three hundred and sixty-six
Ordinalthree million, three hundred and nine thousand, three hundred and sixty-sixth
Scientific notation3.309366 × 10^6
Engineering notation3.309366 × 10^6
In other bases
Ternary20020010121010base 3; the most digit-efficient integer base after e: 14 digits
Quinary1321344431base 5; one hand: 10 digits
Septenary40062204base 7: 8 digits
Nonary6203533base 9; each digit is two ternary digits: 7 digits
Duodecimal1137186base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal10dd86base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal15:19:16:6base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T01T0011TT1010digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101111000001101001010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001100100111111100110110
Bit length22 bitsto write the magnitude
Set bits14the population count, or Hamming weight
Zero bits8within that length
Bit parityeven14 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 7f 36
Gray code1010110100000010101101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001100100111111100110110
64-bit0000000000000000000000000000000000000000001100100111111100110110
One's complement11111111110011011000000011001001at 32 bits, every bit flipped
Bits reversed01101100111111100100110000000000at 32 bits
Rotated left by 100000000011001001111111001101100at 32 bits, wrapping
Shifted left by 111001001111111001101100= 6,618,732, no wrap
Shifted right by 1110010011111110011011= 1,654,683, discarding the low bit
These bits as a double1.63504405 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,309,366 to the power 210,951,903,321,956
3,309,366 to the power 336,243,856,488,968,239,896
3,309,366 to the power 4119,944,186,373,470,868,191,665,936
3,309,366 to the power 5396,939,212,282,027,793,183,980,731,956,576
First ten multiples3,309,366, 6,618,732, 9,928,098, 13,237,464, 16,546,830, 19,856,196, 23,165,562, 26,474,928, 29,784,294, 33,093,660
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
Divisibility tests
Divisible by 2Yes
Divisible by 3Yes
Divisible by 4No, remainder 2
Divisible by 5No, remainder 1
Divisible by 6Yes
Divisible by 7No, remainder 4
Divisible by 8No, remainder 6
Divisible by 9No, remainder 3
Divisible by 10No, remainder 6
Divisible by 11No, remainder 5
Divisible by 12No, remainder 6
Divisible by 100No, remainder 66
Collatz (3n + 1) trajectory
Steps to reach 1146the total stopping time
Highest value reached18,847,8885× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,309,366 → 1,654,683 → 4,964,050 → 2,482,025 → 7,446,076 → 3,723,038 → 1,861,519 → 5,584,558 → 2,792,279 → 8,376,838 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage330,936,600%
3,309,366% as a decimal33,093.66
3,309,366% of 1003,309,366
3,309,366% of 1,00033,093,660
As a fraction of 1003,309,366/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,309,366
Nerdulate something else
Nothing in mind? Surprise me · today’s page