Recognised as Number
3,379,339
- Positive
- Odd
- Composite
- 7 digits
3,379,339 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,379,339
Digit count7
Digit sum37
Digit product45,927
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 factorisation61 × 55,399
Distinct prime factors261, 55,399
Number of divisors4
Sum of divisors σ(n)3,434,800
Aliquot sum55,461sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,323,880integers below n that share no factor with it
Carmichael function λ(n)553,980the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 3,323,880
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 61, 55,399, 3,379,3394 in total
Arithmetic
Previous number3,379,338
Next number3,379,340
Double6,758,678
Half1,689,669.5
Square11,419,932,076,921
Cube38,591,821,844,890,135,219
Square root1,838.297853994≈irrational, shown to 9 decimal places
Cube root150.064253954≈
Negation-3,379,339
Reciprocal2.95915858 × 10^-7≈
Representations
Decimal3,379,339
Binary110011100100001000101122 bits
Octal14710213
Hexadecimal33908B
Base 3620FIJ
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, three hundred and seventy-nine thousand, three hundred and thirty-nine
Ordinalthree million, three hundred and seventy-nine thousand, three hundred and thirty-ninth
Scientific notation3.379339 × 10^6
Engineering notation3.379339 × 10^6
In other bases
Ternary20100200120201base 3; the most digit-efficient integer base after e: 14 digits
Quinary1331114324base 5; one hand: 10 digits
Septenary40503205base 7: 8 digits
Nonary6320521base 9; each digit is two ternary digits: 7 digits
Duodecimal116b777base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal11286jbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal15:38:42:19base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0101T01TT1T01digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101001001000110011111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001100111001000010001011
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 odd
Highest set bitbit 21worth 2,097,152
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes333 90 8b
Gray code1010100101100011001110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001100111001000010001011
64-bit0000000000000000000000000000000000000000001100111001000010001011
One's complement11111111110011000110111101110100at 32 bits, every bit flipped
Bits reversed11010001000010011100110000000000at 32 bits
Rotated left by 100000000011001110010000100010110at 32 bits, wrapping
Shifted left by 111001110010000100010110= 6,758,678, no wrap
Shifted right by 1110011100100001000101= 1,689,669, discarding the low bit
These bits as a double1.66961531 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,379,339 to the power 211,419,932,076,921
3,379,339 to the power 338,591,821,844,890,135,219
3,379,339 to the power 4130,414,848,641,489,184,660,840,241
3,379,339 to the power 5440,715,984,193,281,419,802,579,199,180,699
First ten multiples3,379,339, 6,758,678, 10,138,017, 13,517,356, 16,896,695, 20,276,034, 23,655,373, 27,034,712, 30,414,051, 33,793,390
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 3
Divisible by 5No, remainder 4
Divisible by 6No, remainder 1
Divisible by 7No, remainder 5
Divisible by 8No, remainder 3
Divisible by 9No, remainder 1
Divisible by 10No, remainder 9
Divisible by 11No, remainder 7
Divisible by 12No, remainder 7
Divisible by 100No, remainder 39
Collatz (3n + 1) trajectory
Steps to reach 1221the total stopping time
Highest value reached87,790,55225× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,379,339 → 10,138,018 → 5,069,009 → 15,207,028 → 7,603,514 → 3,801,757 → 11,405,272 → 5,702,636 → 2,851,318 → 1,425,659 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage337,933,900%
3,379,339% as a decimal33,793.39
3,379,339% of 1003,379,339
3,379,339% of 1,00033,793,390
As a fraction of 1003,379,339/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,339
Nerdulate something else
Nothing in mind? Surprise me · today’s page