Recognised as Number
2,331,071
- Positive
- Odd
- Composite
- 7 digits
2,331,071 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 8.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value2,331,071
Digit count7
Digit sum17
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation283 × 8,237
Distinct prime factors2283, 8,237
Number of divisors4
Sum of divisors σ(n)2,339,592
Aliquot sum8,521sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,322,552integers below n that share no factor with it
Carmichael function λ(n)1,161,276the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,322,552
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 283, 8,237, 2,331,0714 in total
Arithmetic
Previous number2,331,070
Next number2,331,072
Double4,662,142
Half1,165,535.5
Square5,433,892,007,041
Cube12,666,788,074,745,070,911
Square root1,526.784529657≈irrational, shown to 9 decimal places
Cube root132.592359955≈
Negation-2,331,071
Reciprocal4.28987362 × 10^-7≈
Representations
Decimal2,331,071
Binary100011100100011011111122 bits
Octal10710677
Hexadecimal2391BF
Base 361DYNZ
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, three hundred and thirty-one thousand and seventy-one
Ordinaltwo million, three hundred and thirty-one thousand and seventy-first
Scientific notation2.331071 × 10^6
Engineering notation2.331071 × 10^6
In other bases
Ternary11101102121222base 3; the most digit-efficient integer base after e: 14 digits
Quinary1044043241base 5; one hand: 10 digits
Septenary25546061base 7: 8 digits
Nonary4342558base 9; each digit is two ternary digits: 7 digits
Duodecimal944bbbbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimaleb7dbbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal10:47:31:11base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary11101110T0T00Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11001001001011011000011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001000111001000110111111
Bit length22 bitsto write the magnitude
Set bits13the population count, or Hamming weight
Zero bits9within that length
Bit parityodd13 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
Bytes323 91 bf
Gray code1100100101100101100000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001000111001000110111111
64-bit0000000000000000000000000000000000000000001000111001000110111111
One's complement11111111110111000110111001000000at 32 bits, every bit flipped
Bits reversed11111101100010011100010000000000at 32 bits
Rotated left by 100000000010001110010001101111110at 32 bits, wrapping
Shifted left by 110001110010001101111110= 4,662,142, no wrap
Shifted right by 1100011100100011011111= 1,165,535, discarding the low bit
These bits as a double1.1517021 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,331,071 to the power 25,433,892,007,041
2,331,071 to the power 312,666,788,074,745,070,911
2,331,071 to the power 429,527,182,344,184,067,193,575,681
2,331,071 to the power 568,829,958,474,239,497,696,995,656,284,351
First ten multiples2,331,071, 4,662,142, 6,993,213, 9,324,284, 11,655,355, 13,986,426, 16,317,497, 18,648,568, 20,979,639, 23,310,710
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 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 1
Divisible by 8No, remainder 7
Divisible by 9No, remainder 8
Divisible by 10No, remainder 1
Divisible by 11No, remainder 6
Divisible by 12No, remainder 11
Divisible by 100No, remainder 71
Collatz (3n + 1) trajectory
Steps to reach 1254the total stopping time
Highest value reached89,614,24038× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,331,071 → 6,993,214 → 3,496,607 → 10,489,822 → 5,244,911 → 15,734,734 → 7,867,367 → 23,602,102 → 11,801,051 → 35,403,154 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage233,107,100%
2,331,071% as a decimal23,310.71
2,331,071% of 1002,331,071
2,331,071% of 1,00023,310,710
As a fraction of 1002,331,071/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,331,071
Nerdulate something else
Nothing in mind? Surprise me · today’s page