Recognised as Number
3,379,340
- Positive
- Even
- Composite
- 7 digits
3,379,340 is an even 7-digit integer and a composite number. It has 24 divisors and a digital root of 2.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value3,379,340
Digit count7
Digit sum29
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^2 × 5 × 19 × 8,893
Distinct prime factors42, 5, 19, 8,893
Number of divisors24
Sum of divisors σ(n)7,470,960
Aliquot sum4,091,620sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)1,280,448integers below n that share no factor with it
Carmichael function λ(n)8,892the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,280,448
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 5, 10, 19, 20, 38, 76, 95, 190, 380, 8,893, 17,786, 35,572, 44,465, 88,930, 168,967, 177,860, 337,934, 675,868, 844,835, 1,689,670, 3,379,34024 in total
Arithmetic
Previous number3,379,339
Next number3,379,341
Double6,758,680
Half1,689,670
Square11,419,938,835,600
Cube38,591,856,104,696,504,000
Square root1,838.298125985≈irrational, shown to 9 decimal places
Cube root150.064268756≈
Negation-3,379,340
Reciprocal2.95915771 × 10^-7≈
Representations
Decimal3,379,340
Binary110011100100001000110022 bits
Octal14710214
Hexadecimal33908C
Base 3620FIK
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, three hundred and seventy-nine thousand, three hundred and forty
Ordinalthree million, three hundred and seventy-nine thousand, three hundred and fortieth
Scientific notation3.37934 × 10^6
Engineering notation3.37934 × 10^6
In other bases
Ternary20100200120202base 3; the most digit-efficient integer base after e: 14 digits
Quinary1331114330base 5; one hand: 10 digits
Septenary40503206base 7: 8 digits
Nonary6320522base 9; each digit is two ternary digits: 7 digits
Duodecimal116b778base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal112870base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal15:38:42:20base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0101T01TT1T1Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101001001000110011100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001100111001000010001100
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 22 trailing zeros
Power of twoNo
Bytes333 90 8c
Gray code1010100101100011001010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001100111001000010001100
64-bit0000000000000000000000000000000000000000001100111001000010001100
One's complement11111111110011000110111101110011at 32 bits, every bit flipped
Bits reversed00110001000010011100110000000000at 32 bits
Rotated left by 100000000011001110010000100011000at 32 bits, wrapping
Shifted left by 111001110010000100011000= 6,758,680, no wrap
Shifted right by 1110011100100001000110= 1,689,670, discarding the low bit
These bits as a double1.6696158 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,379,340 to the power 211,419,938,835,600
3,379,340 to the power 338,591,856,104,696,504,000
3,379,340 to the power 4130,415,003,008,845,083,827,360,000
3,379,340 to the power 5440,716,636,267,910,545,581,150,742,400,000
First ten multiples3,379,340, 6,758,680, 10,138,020, 13,517,360, 16,896,700, 20,276,040, 23,655,380, 27,034,720, 30,414,060, 33,793,400
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 4Yes
Divisible by 5Yes
Divisible by 6No, remainder 2
Divisible by 7No, remainder 6
Divisible by 8No, remainder 4
Divisible by 9No, remainder 2
Divisible by 10Yes
Divisible by 11No, remainder 8
Divisible by 12No, remainder 8
Divisible by 100No, remainder 40
Collatz (3n + 1) trajectory
Steps to reach 1146the total stopping time
Highest value reached3,801,7601× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,379,340 → 1,689,670 → 844,835 → 2,534,506 → 1,267,253 → 3,801,760 → 1,900,880 → 950,440 → 475,220 → 237,610 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage337,934,000%
3,379,340% as a decimal33,793.4
3,379,340% of 1003,379,340
3,379,340% of 1,00033,793,400
As a fraction of 1003,379,340/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,379,340
Nerdulate something else
Nothing in mind? Surprise me · today’s page