Recognised as Number
2,714,311
- Positive
- Odd
- Prime
- 7 digits
2,714,311 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value2,714,311
Digit count7
Digit sum19
Digit product168
Multiplicative persistence4times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2,714,311
Distinct prime factors12,714,311
Number of divisors2
Sum of divisors σ(n)2,714,312
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,714,310integers below n that share no factor with it
Carmichael function λ(n)2,714,310the 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,714,3112 in total
Arithmetic
Previous number2,714,310
Next number2,714,312
Double5,428,622
Half1,357,155.5
Square7,367,484,204,721
Cube19,997,643,419,200,462,231
Square root1,647.516616001≈irrational, shown to 9 decimal places
Cube root139.493253015≈
Negation-2,714,311
Reciprocal3.68417621 × 10^-7≈
Representations
Decimal2,714,311
Binary101001011010101100011122 bits
Octal12265307
Hexadecimal296AC7
Base 361M6DJ
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, seven hundred and fourteen thousand, three hundred and eleven
Ordinaltwo million, seven hundred and fourteen thousand, three hundred and eleventh
Scientific notation2.714311 × 10^6
Engineering notation2.714311 × 10^6
In other bases
Ternary12002220100001base 3; the most digit-efficient integer base after e: 14 digits
Quinary1143324221base 5; one hand: 10 digits
Septenary32033305base 7: 8 digits
Nonary5086301base 9; each digit is two ternary digits: 7 digits
Duodecimalaaa947base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalgj5fbbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal12:33:58:31base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1TT0100T0100001digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11111101011111111011011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001010010110101011000111
Bit length22 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits10within that length
Bit parityeven12 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
Bytes329 6a c7
Gray code1111011101111110100100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001010010110101011000111
64-bit0000000000000000000000000000000000000000001010010110101011000111
One's complement11111111110101101001010100111000at 32 bits, every bit flipped
Bits reversed11100011010101101001010000000000at 32 bits
Rotated left by 100000000010100101101010110001110at 32 bits, wrapping
Shifted left by 110100101101010110001110= 5,428,622, no wrap
Shifted right by 1101001011010101100011= 1,357,155, discarding the low bit
These bits as a double1.34104782 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,714,311 to the power 27,367,484,204,721
2,714,311 to the power 319,997,643,419,200,462,231
2,714,311 to the power 454,279,823,506,813,425,838,687,841
2,714,311 to the power 5147,332,322,022,602,256,701,634,632,392,551
First ten multiples2,714,311, 5,428,622, 8,142,933, 10,857,244, 13,571,555, 16,285,866, 19,000,177, 21,714,488, 24,428,799, 27,143,110
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 1
Divisible by 6No, remainder 1
Divisible by 7No, remainder 5
Divisible by 8No, remainder 7
Divisible by 9No, remainder 1
Divisible by 10No, remainder 1
Divisible by 11No, remainder 6
Divisible by 12No, remainder 7
Divisible by 100No, remainder 11
Collatz (3n + 1) trajectory
Steps to reach 1138the total stopping time
Highest value reached18,321,6046× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,714,311 → 8,142,934 → 4,071,467 → 12,214,402 → 6,107,201 → 18,321,604 → 9,160,802 → 4,580,401 → 13,741,204 → 6,870,602 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage271,431,100%
2,714,311% as a decimal27,143.11
2,714,311% of 1002,714,311
2,714,311% of 1,00027,143,110
As a fraction of 1002,714,311/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,714,311
Nerdulate something else
Nothing in mind? Surprise me · today’s page