Recognised as Number
2,712,967
- Positive
- Odd
- Composite
- 7 digits
2,712,967 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value2,712,967
Digit count7
Digit sum34
Digit product10,584
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation199 × 13,633
Distinct prime factors2199, 13,633
Number of divisors4
Sum of divisors σ(n)2,726,800
Aliquot sum13,833sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,699,136integers below n that share no factor with it
Carmichael function λ(n)449,856the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,699,136
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 199, 13,633, 2,712,9674 in total
Arithmetic
Previous number2,712,966
Next number2,712,968
Double5,425,934
Half1,356,483.5
Square7,360,189,943,089
Cube19,967,952,429,332,335,063
Square root1,647.108678867≈irrational, shown to 9 decimal places
Cube root139.4702257≈
Negation-2,712,967
Reciprocal3.68600134 × 10^-7≈
Representations
Decimal2,712,967
Binary101001011001011000011122 bits
Octal12262607
Hexadecimal296587
Base 361M5C7
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, seven hundred and twelve thousand, nine hundred and sixty-seven
Ordinaltwo million, seven hundred and twelve thousand, nine hundred and sixty-seventh
Scientific notation2.712967 × 10^6
Engineering notation2.712967 × 10^6
In other bases
Ternary12002211111021base 3; the most digit-efficient integer base after e: 14 digits
Quinary1143303332base 5; one hand: 10 digits
Septenary32026345base 7: 8 digits
Nonary5084437base 9; each digit is two ternary digits: 7 digits
Duodecimalaaa007base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalgj287base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal12:33:36:7base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1TT010T111111T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11111101011101010011011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001010010110010110000111
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 87
Gray code1111011101011101000100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001010010110010110000111
64-bit0000000000000000000000000000000000000000001010010110010110000111
One's complement11111111110101101001101001111000at 32 bits, every bit flipped
Bits reversed11100001101001101001010000000000at 32 bits
Rotated left by 100000000010100101100101100001110at 32 bits, wrapping
Shifted left by 110100101100101100001110= 5,425,934, no wrap
Shifted right by 1101001011001011000011= 1,356,483, discarding the low bit
These bits as a double1.34038379 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,712,967 to the power 27,360,189,943,089
2,712,967 to the power 319,967,952,429,332,335,063
2,712,967 to the power 454,172,395,998,348,457,058,861,921
2,712,967 to the power 5146,967,922,654,451,418,501,609,449,229,607
First ten multiples2,712,967, 5,425,934, 8,138,901, 10,851,868, 13,564,835, 16,277,802, 18,990,769, 21,703,736, 24,416,703, 27,129,670
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 3
Divisible by 5No, remainder 2
Divisible by 6No, remainder 1
Divisible by 7No, remainder 5
Divisible by 8No, remainder 7
Divisible by 9No, remainder 7
Divisible by 10No, remainder 7
Divisible by 11No, remainder 4
Divisible by 12No, remainder 7
Divisible by 100No, remainder 67
Collatz (3n + 1) trajectory
Steps to reach 1156the total stopping time
Highest value reached18,312,5326× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,712,967 → 8,138,902 → 4,069,451 → 12,208,354 → 6,104,177 → 18,312,532 → 9,156,266 → 4,578,133 → 13,734,400 → 6,867,200 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage271,296,700%
2,712,967% as a decimal27,129.67
2,712,967% of 1002,712,967
2,712,967% of 1,00027,129,670
As a fraction of 1002,712,967/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,967
Nerdulate something else
Nothing in mind? Surprise me · today’s page