Recognised as Number
3,279,371
- Positive
- Odd
- Composite
- 7 digits
3,279,371 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 5.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,279,371
Digit count7
Digit sum32
Digit product7,938
Multiplicative persistence4times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation271 × 12,101
Distinct prime factors2271, 12,101
Number of divisors4
Sum of divisors σ(n)3,291,744
Aliquot sum12,373sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,267,000integers below n that share no factor with it
Carmichael function λ(n)326,700the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 3,267,000
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 271, 12,101, 3,279,3714 in total
Arithmetic
Previous number3,279,370
Next number3,279,372
Double6,558,742
Half1,639,685.5
Square10,754,274,155,641
Cube35,267,254,792,058,581,811
Square root1,810.903365727≈irrational, shown to 9 decimal places
Cube root148.56967863≈
Negation-3,279,371
Reciprocal3.04936526 × 10^-7≈
Representations
Decimal3,279,371
Binary110010000010100000101122 bits
Octal14405013
Hexadecimal320A0B
Base 361YADN
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, two hundred and seventy-nine thousand, three hundred and seventy-one
Ordinalthree million, two hundred and seventy-nine thousand, three hundred and seventy-first
Scientific notation3.279371 × 10^6
Engineering notation3.279371 × 10^6
In other bases
Ternary20011121110012base 3; the most digit-efficient integer base after e: 14 digits
Quinary1314414441base 5; one hand: 10 digits
Septenary36605564base 7: 8 digits
Nonary6147405base 9; each digit is two ternary digits: 7 digits
Duodecimal112194bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal109i8bbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal15:10:56:11base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T01TTTT11101TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101100001111000011111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001100100000101000001011
Bit length22 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits14within that length
Bit parityeven8 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
Bytes332 0a 0b
Gray code1010110000111100001110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001100100000101000001011
64-bit0000000000000000000000000000000000000000001100100000101000001011
One's complement11111111110011011111010111110100at 32 bits, every bit flipped
Bits reversed11010000010100000100110000000000at 32 bits
Rotated left by 100000000011001000001010000010110at 32 bits, wrapping
Shifted left by 111001000001010000010110= 6,558,742, no wrap
Shifted right by 1110010000010100000101= 1,639,685, discarding the low bit
These bits as a double1.62022455 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,279,371 to the power 210,754,274,155,641
3,279,371 to the power 335,267,254,792,058,581,811
3,279,371 to the power 4115,654,412,614,687,943,492,120,881
3,279,371 to the power 5379,273,726,750,641,815,937,699,945,645,851
First ten multiples3,279,371, 6,558,742, 9,838,113, 13,117,484, 16,396,855, 19,676,226, 22,955,597, 26,234,968, 29,514,339, 32,793,710
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 2
Divisible by 4No, remainder 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 4
Divisible by 8No, remainder 3
Divisible by 9No, remainder 5
Divisible by 10No, remainder 1
Divisible by 11No, remainder 7
Divisible by 12No, remainder 11
Divisible by 100No, remainder 71
Collatz (3n + 1) trajectory
Steps to reach 189the total stopping time
Highest value reached14,757,1724× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,279,371 → 9,838,114 → 4,919,057 → 14,757,172 → 7,378,586 → 3,689,293 → 11,067,880 → 5,533,940 → 2,766,970 → 1,383,485 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage327,937,100%
3,279,371% as a decimal32,793.71
3,279,371% of 1003,279,371
3,279,371% of 1,00032,793,710
As a fraction of 1003,279,371/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,279,371
Nerdulate something else
Nothing in mind? Surprise me · today’s page