Recognised as Number
3,381,279
- Positive
- Odd
- Composite
- 7 digits
3,381,279 is an odd 7-digit integer and a composite number. It has 16 divisors and a digital root of 6.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,381,279
Digit count7
Digit sum33
Digit product9,072
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root6repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberYesdivisible by its own digit sum
Factors & divisors
Prime factorisation3 × 11 × 79 × 1,297
Distinct prime factors43, 11, 79, 1,297
Number of divisors16
Sum of divisors σ(n)4,984,320
Aliquot sum1,603,041sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,021,760integers below n that share no factor with it
Carmichael function λ(n)84,240the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,021,760
Möbius function μ(n)+14 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 3, 11, 33, 79, 237, 869, 1,297, 2,607, 3,891, 14,267, 42,801, 102,463, 307,389, 1,127,093, 3,381,27916 in total
Arithmetic
Previous number3,381,278
Next number3,381,280
Double6,762,558
Half1,690,639.5
Square11,433,047,675,841
Cube38,658,324,012,319,980,639
Square root1,838.825440329≈irrational, shown to 9 decimal places
Cube root150.092964594≈
Negation-3,381,279
Reciprocal2.95746077 × 10^-7≈
Representations
Decimal3,381,279
Binary110011100110000001111122 bits
Octal14714037
Hexadecimal33981F
Base 3620H0F
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, three hundred and eighty-one thousand, two hundred and seventy-nine
Ordinalthree million, three hundred and eighty-one thousand, two hundred and seventy-ninth
Scientific notation3.381279 × 10^6
Engineering notation3.381279 × 10^6
In other bases
Ternary20100210020120base 3; the most digit-efficient integer base after e: 14 digits
Quinary1331200104base 5; one hand: 10 digits
Septenary40511646base 7: 8 digits
Nonary6323216base 9; each digit is two ternary digits: 7 digits
Duodecimal1170913base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal112d3jbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal15:39:14:39base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0101T101T1TT0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101001110100001100011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001100111001100000011111
Bit length22 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits10within that length
Bit parityeven12 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 98 1f
Gray code1010100101010000010000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001100111001100000011111
64-bit0000000000000000000000000000000000000000001100111001100000011111
One's complement11111111110011000110011111100000at 32 bits, every bit flipped
Bits reversed11111000000110011100110000000000at 32 bits
Rotated left by 100000000011001110011000000111110at 32 bits, wrapping
Shifted left by 111001110011000000111110= 6,762,558, no wrap
Shifted right by 1110011100110000001111= 1,690,639, discarding the low bit
These bits as a double1.67057379 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,381,279 to the power 211,433,047,675,841
3,381,279 to the power 338,658,324,012,319,980,639
3,381,279 to the power 4130,714,579,158,053,291,815,057,281
3,381,279 to the power 5441,982,461,500,963,276,495,125,068,042,399
First ten multiples3,381,279, 6,762,558, 10,143,837, 13,525,116, 16,906,395, 20,287,674, 23,668,953, 27,050,232, 30,431,511, 33,812,790
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 3
Divisible by 5No, remainder 4
Divisible by 6No, remainder 3
Divisible by 7No, remainder 6
Divisible by 8No, remainder 7
Divisible by 9No, remainder 6
Divisible by 10No, remainder 9
Divisible by 11Yes
Divisible by 12No, remainder 3
Divisible by 100No, remainder 79
Collatz (3n + 1) trajectory
Steps to reach 1133the total stopping time
Highest value reached51,353,18815× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,381,279 → 10,143,838 → 5,071,919 → 15,215,758 → 7,607,879 → 22,823,638 → 11,411,819 → 34,235,458 → 17,117,729 → 51,353,188 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage338,127,900%
3,381,279% as a decimal33,812.79
3,381,279% of 1003,381,279
3,381,279% of 1,00033,812,790
As a fraction of 1003,381,279/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,381,279
Nerdulate something else
Nothing in mind? Surprise me · today’s page