Recognised as Number
2,711,084
- Positive
- Even
- Composite
- 7 digits
2,711,084 is an even 7-digit integer and a composite number. It has 24 divisors and a digital root of 5.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value2,711,084
Digit count7
Digit sum23
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times 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 factorisation2^2 × 41 × 61 × 271
Distinct prime factors42, 41, 61, 271
Number of divisors24
Sum of divisors σ(n)4,958,016
Aliquot sum2,246,932sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,296,000integers below n that share no factor with it
Carmichael function λ(n)1,080the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,296,000
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 41, 61, 82, 122, 164, 244, 271, 542, 1,084, 2,501, 5,002, 10,004, 11,111, 16,531, 22,222, 33,062, 44,444, 66,124, 677,771, 1,355,542, 2,711,08424 in total
Arithmetic
Previous number2,711,083
Next number2,711,085
Double5,422,168
Half1,355,542
Square7,349,976,455,056
Cube19,926,403,567,679,040,704
Square root1,646.536971951≈irrational, shown to 9 decimal places
Cube root139.437950677≈
Negation-2,711,084
Reciprocal3.68856148 × 10^-7≈
Representations
Decimal2,711,084
Binary101001010111100010110022 bits
Octal12257054
Hexadecimal295E2C
Base 361M3VW
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, seven hundred and eleven thousand and eighty-four
Ordinaltwo million, seven hundred and eleven thousand and eighty-fourth
Scientific notation2.711084 × 10^6
Engineering notation2.711084 × 10^6
In other bases
Ternary12002201220112base 3; the most digit-efficient integer base after e: 14 digits
Quinary1143223314base 5; one hand: 10 digits
Septenary32021015base 7: 8 digits
Nonary5081815base 9; each digit is two ternary digits: 7 digits
Duodecimalaa8ab8base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalgihe4base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal12:33:4:44base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1TT010T1T0T1TTTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11111101010001001111100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001010010101111000101100
Bit length22 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits11within that length
Bit parityodd11 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
Bytes329 5e 2c
Gray code1111011111000100111010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001010010101111000101100
64-bit0000000000000000000000000000000000000000001010010101111000101100
One's complement11111111110101101010000111010011at 32 bits, every bit flipped
Bits reversed00110100011110101001010000000000at 32 bits
Rotated left by 100000000010100101011110001011000at 32 bits, wrapping
Shifted left by 110100101011110001011000= 5,422,168, no wrap
Shifted right by 1101001010111100010110= 1,355,542, discarding the low bit
These bits as a double1.33945347 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,711,084 to the power 27,349,976,455,056
2,711,084 to the power 319,926,403,567,679,040,704
2,711,084 to the power 454,022,153,889,877,564,387,963,136
2,711,084 to the power 5146,458,597,056,384,826,771,176,650,599,424
First ten multiples2,711,084, 5,422,168, 8,133,252, 10,844,336, 13,555,420, 16,266,504, 18,977,588, 21,688,672, 24,399,756, 27,110,840
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 5No, remainder 4
Divisible by 6No, remainder 2
Divisible by 7No, remainder 5
Divisible by 8No, remainder 4
Divisible by 9No, remainder 5
Divisible by 10No, remainder 4
Divisible by 11No, remainder 2
Divisible by 12No, remainder 8
Divisible by 100No, remainder 84
Collatz (3n + 1) trajectory
Steps to reach 1138the total stopping time
Highest value reached16,488,5206× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,711,084 → 1,355,542 → 677,771 → 2,033,314 → 1,016,657 → 3,049,972 → 1,524,986 → 762,493 → 2,287,480 → 1,143,740 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage271,108,400%
2,711,084% as a decimal27,110.84
2,711,084% of 1002,711,084
2,711,084% of 1,00027,110,840
As a fraction of 1002,711,084/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 2,711,084
Nerdulate something else
Nothing in mind? Surprise me · today’s page