Recognised as Number
2,712,937
- Positive
- Odd
- Composite
- 7 digits
2,712,937 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value2,712,937
Digit count7
Digit sum31
Digit product5,292
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation241 × 11,257
Distinct prime factors2241, 11,257
Number of divisors4
Sum of divisors σ(n)2,724,436
Aliquot sum11,499sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,701,440integers below n that share no factor with it
Carmichael function λ(n)112,560the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,701,440
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 241, 11,257, 2,712,9374 in total
Arithmetic
Previous number2,712,936
Next number2,712,938
Double5,425,874
Half1,356,468.5
Square7,360,027,165,969
Cube19,967,290,019,562,440,953
Square root1,647.099571975≈irrational, shown to 9 decimal places
Cube root139.46971161≈
Negation-2,712,937
Reciprocal3.6860421 × 10^-7≈
Representations
Decimal2,712,937
Binary101001011001010110100122 bits
Octal12262551
Hexadecimal296569
Base 361M5BD
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, seven hundred and twelve thousand, nine hundred and thirty-seven
Ordinaltwo million, seven hundred and twelve thousand, nine hundred and thirty-seventh
Scientific notation2.712937 × 10^6
Engineering notation2.712937 × 10^6
In other bases
Ternary12002211110011base 3; the most digit-efficient integer base after e: 14 digits
Quinary1143303222base 5; one hand: 10 digits
Septenary32026303base 7: 8 digits
Nonary5084404base 9; each digit is two ternary digits: 7 digits
Duodecimalaa9ba1base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalgj26hbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal12:33:35:37base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1TT010T11110011digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11111101011101010111001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001010010110010101101001
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 65 69
Gray code1111011101011111011101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001010010110010101101001
64-bit0000000000000000000000000000000000000000001010010110010101101001
One's complement11111111110101101001101010010110at 32 bits, every bit flipped
Bits reversed10010110101001101001010000000000at 32 bits
Rotated left by 100000000010100101100101011010010at 32 bits, wrapping
Shifted left by 110100101100101011010010= 5,425,874, no wrap
Shifted right by 1101001011001010110100= 1,356,468, discarding the low bit
These bits as a double1.34036897 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,712,937 to the power 27,360,027,165,969
2,712,937 to the power 319,967,290,019,562,440,953
2,712,937 to the power 454,169,999,883,801,669,871,708,961
2,712,937 to the power 5146,959,796,974,761,250,856,744,493,528,457
First ten multiples2,712,937, 5,425,874, 8,138,811, 10,851,748, 13,564,685, 16,277,622, 18,990,559, 21,703,496, 24,416,433, 27,129,370
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 1
Divisible by 5No, remainder 2
Divisible by 6No, remainder 1
Divisible by 7No, remainder 3
Divisible by 8No, remainder 1
Divisible by 9No, remainder 4
Divisible by 10No, remainder 7
Divisible by 11No, remainder 7
Divisible by 12No, remainder 1
Divisible by 100No, remainder 37
Collatz (3n + 1) trajectory
Steps to reach 1169the total stopping time
Highest value reached20,601,3767× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,712,937 → 8,138,812 → 4,069,406 → 2,034,703 → 6,104,110 → 3,052,055 → 9,156,166 → 4,578,083 → 13,734,250 → 6,867,125 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage271,293,700%
2,712,937% as a decimal27,129.37
2,712,937% of 1002,712,937
2,712,937% of 1,00027,129,370
As a fraction of 1002,712,937/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,712,937
Nerdulate something else
Nothing in mind? Surprise me · today’s page