Recognised as Number
2,311,249
- Positive
- Odd
- Prime
- 7 digits
2,311,249 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value2,311,249
Digit count7
Digit sum22
Digit product432
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 factorisation2,311,249
Distinct prime factors12,311,249
Number of divisors2
Sum of divisors σ(n)2,311,250
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,311,248integers below n that share no factor with it
Carmichael function λ(n)2,311,248the 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,311,2492 in total
Arithmetic
Previous number2,311,248
Next number2,311,250
Double4,622,498
Half1,155,624.5
Square5,341,871,940,001
Cube12,346,396,179,455,371,249
Square root1,520.279250664≈irrational, shown to 9 decimal places
Cube root132.215461552≈
Negation-2,311,249
Reciprocal4.32666493 × 10^-7≈
Representations
Decimal2,311,249
Binary100011010001000101000122 bits
Octal10642121
Hexadecimal234451
Base 361DJDD
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, three hundred and eleven thousand, two hundred and forty-nine
Ordinaltwo million, three hundred and eleven thousand, two hundred and forty-ninth
Scientific notation2.311249 × 10^6
Engineering notation2.311249 × 10^6
In other bases
Ternary11100102102211base 3; the most digit-efficient integer base after e: 14 digits
Quinary1042424444base 5; one hand: 10 digits
Septenary25434223base 7: 8 digits
Nonary4312384base 9; each digit is two ternary digits: 7 digits
Duodecimal935641base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimale8i29base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal10:42:0:49base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1110011T110T11digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11001110100010001010001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001000110100010001010001
Bit length22 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits14within that length
Bit parityeven8 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
Bytes323 44 51
Gray code1100101110011001111001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001000110100010001010001
64-bit0000000000000000000000000000000000000000001000110100010001010001
One's complement11111111110111001011101110101110at 32 bits, every bit flipped
Bits reversed10001010001000101100010000000000at 32 bits
Rotated left by 100000000010001101000100010100010at 32 bits, wrapping
Shifted left by 110001101000100010100010= 4,622,498, no wrap
Shifted right by 1100011010001000101000= 1,155,624, discarding the low bit
These bits as a double1.14190873 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,311,249 to the power 25,341,871,940,001
2,311,249 to the power 312,346,396,179,455,371,249
2,311,249 to the power 428,535,595,823,370,047,343,880,001
2,311,249 to the power 565,952,867,311,168,198,553,495,308,431,249
First ten multiples2,311,249, 4,622,498, 6,933,747, 9,244,996, 11,556,245, 13,867,494, 16,178,743, 18,489,992, 20,801,241, 23,112,490
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 4
Divisible by 6No, remainder 1
Divisible by 7No, remainder 3
Divisible by 8No, remainder 1
Divisible by 9No, remainder 4
Divisible by 10No, remainder 9
Divisible by 11No, remainder 6
Divisible by 12No, remainder 1
Divisible by 100No, remainder 49
Collatz (3n + 1) trajectory
Steps to reach 1184the total stopping time
Highest value reached6,933,7483× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,311,249 → 6,933,748 → 3,466,874 → 1,733,437 → 5,200,312 → 2,600,156 → 1,300,078 → 650,039 → 1,950,118 → 975,059 → …
Last steps… → 32 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage231,124,900%
2,311,249% as a decimal23,112.49
2,311,249% of 1002,311,249
2,311,249% of 1,00023,112,490
As a fraction of 1002,311,249/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,311,249
Nerdulate something else
Nothing in mind? Surprise me · today’s page