Recognised as Number
2,832,359
- Positive
- Odd
- Prime
- 7 digits
2,832,359 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 5.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value2,832,359
Digit count7
Digit sum32
Digit product12,960
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2,832,359
Distinct prime factors12,832,359
Number of divisors2
Sum of divisors σ(n)2,832,360
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,832,358integers below n that share no factor with it
Carmichael function λ(n)2,832,358the 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,832,3592 in total
Arithmetic
Previous number2,832,358
Next number2,832,360
Double5,664,718
Half1,416,179.5
Square8,022,257,504,881
Cube22,721,913,244,267,244,279
Square root1,682.961378048≈irrational, shown to 9 decimal places
Cube root141.486857149≈
Negation-2,832,359
Reciprocal3.53062588 × 10^-7≈
Representations
Decimal2,832,359
Binary101011001101111110011122 bits
Octal12633747
Hexadecimal2B37E7
Base 361OPGN
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, eight hundred and thirty-two thousand, three hundred and fifty-nine
Ordinaltwo million, eight hundred and thirty-two thousand, three hundred and fifty-ninth
Scientific notation2.832359 × 10^6
Engineering notation2.832359 × 10^6
In other bases
Ternary12022220021012base 3; the most digit-efficient integer base after e: 14 digits
Quinary1211113414base 5; one hand: 10 digits
Septenary33034415base 7: 8 digits
Nonary5286235base 9; each digit is two ternary digits: 7 digits
Duodecimalb4711bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalhe0hjbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal13:6:45:59base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1TT1000T01T11TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11111110100100000111011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001010110011011111100111
Bit length22 bitsto write the magnitude
Set bits15the population count, or Hamming weight
Zero bits7within that length
Bit parityodd15 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
Bytes32b 37 e7
Gray code1111101010110000010100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001010110011011111100111
64-bit0000000000000000000000000000000000000000001010110011011111100111
One's complement11111111110101001100100000011000at 32 bits, every bit flipped
Bits reversed11100111111011001101010000000000at 32 bits
Rotated left by 100000000010101100110111111001110at 32 bits, wrapping
Shifted left by 110101100110111111001110= 5,664,718, no wrap
Shifted right by 1101011001101111110011= 1,416,179, discarding the low bit
These bits as a double1.39937128 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,832,359 to the power 28,022,257,504,881
2,832,359 to the power 322,721,913,244,267,244,279
2,832,359 to the power 464,356,615,474,619,527,738,824,161
2,832,359 to the power 5182,281,039,049,077,890,966,808,261,825,799
First ten multiples2,832,359, 5,664,718, 8,497,077, 11,329,436, 14,161,795, 16,994,154, 19,826,513, 22,658,872, 25,491,231, 28,323,590
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 4
Divisible by 6No, remainder 5
Divisible by 7No, remainder 5
Divisible by 8No, remainder 7
Divisible by 9No, remainder 5
Divisible by 10No, remainder 9
Divisible by 11No, remainder 2
Divisible by 12No, remainder 11
Divisible by 100No, remainder 59
Collatz (3n + 1) trajectory
Steps to reach 1107the total stopping time
Highest value reached32,262,35211× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,832,359 → 8,497,078 → 4,248,539 → 12,745,618 → 6,372,809 → 19,118,428 → 9,559,214 → 4,779,607 → 14,338,822 → 7,169,411 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage283,235,900%
2,832,359% as a decimal28,323.59
2,832,359% of 1002,832,359
2,832,359% of 1,00028,323,590
As a fraction of 1002,832,359/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,832,359
Nerdulate something else
Nothing in mind? Surprise me · today’s page