Recognised as Number
2,701,343
- Positive
- Odd
- Prime
- 7 digits
2,701,343 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value2,701,343
Digit count7
Digit sum20
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,701,343
Distinct prime factors12,701,343
Number of divisors2
Sum of divisors σ(n)2,701,344
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,701,342integers below n that share no factor with it
Carmichael function λ(n)2,701,342the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)−11 distinct prime factor, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 2,701,3432 in total
Arithmetic
Previous number2,701,342
Next number2,701,344
Double5,402,686
Half1,350,671.5
Square7,297,254,003,649
Cube19,712,386,021,979,200,607
Square root1,643.576283596≈irrational, shown to 9 decimal places
Cube root139.270748788≈
Negation-2,701,343
Reciprocal3.70186237 × 10^-7≈
Representations
Decimal2,701,343
Binary101001001110000001111122 bits
Octal12234037
Hexadecimal29381F
Base 361LWDB
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, seven hundred and one thousand, three hundred and forty-three
Ordinaltwo million, seven hundred and one thousand, three hundred and forty-third
Scientific notation2.701343 × 10^6
Engineering notation2.701343 × 10^6
In other bases
Ternary12002020112202base 3; the most digit-efficient integer base after e: 14 digits
Quinary1142420333base 5; one hand: 10 digits
Septenary31650431base 7: 8 digits
Nonary5066482base 9; each digit is two ternary digits: 7 digits
Duodecimalaa333bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalghd73base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal12:30:22:23base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1TT01T1T1TT0T1Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11110010100100001100011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001010010011100000011111
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 odd
Highest set bitbit 21worth 2,097,152
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes329 38 1f
Gray code1111011010010000010000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001010010011100000011111
64-bit0000000000000000000000000000000000000000001010010011100000011111
One's complement11111111110101101100011111100000at 32 bits, every bit flipped
Bits reversed11111000000111001001010000000000at 32 bits
Rotated left by 100000000010100100111000000111110at 32 bits, wrapping
Shifted left by 110100100111000000111110= 5,402,686, no wrap
Shifted right by 1101001001110000001111= 1,350,671, discarding the low bit
These bits as a double1.33464077 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,701,343 to the power 27,297,254,003,649
2,701,343 to the power 319,712,386,021,979,200,607
2,701,343 to the power 453,249,915,993,771,359,705,315,201
2,701,343 to the power 5143,846,287,820,362,306,140,435,281,014,943
First ten multiples2,701,343, 5,402,686, 8,104,029, 10,805,372, 13,506,715, 16,208,058, 18,909,401, 21,610,744, 24,312,087, 27,013,430
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 3
Divisible by 6No, remainder 5
Divisible by 7No, remainder 1
Divisible by 8No, remainder 7
Divisible by 9No, remainder 2
Divisible by 10No, remainder 3
Divisible by 11No, remainder 7
Divisible by 12No, remainder 11
Divisible by 100No, remainder 43
Collatz (3n + 1) trajectory
Steps to reach 1187the total stopping time
Highest value reached41,026,66015× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,701,343 → 8,104,030 → 4,052,015 → 12,156,046 → 6,078,023 → 18,234,070 → 9,117,035 → 27,351,106 → 13,675,553 → 41,026,660 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage270,134,300%
2,701,343% as a decimal27,013.43
2,701,343% of 1002,701,343
2,701,343% of 1,00027,013,430
As a fraction of 1002,701,343/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,701,343
Nerdulate something else
Nothing in mind? Surprise me · today’s page