Recognised as Number
2,832,361
- Positive
- Odd
- Composite
- 7 digits
2,832,361 is an odd 7-digit integer and a composite number. It has 8 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value2,832,361
Digit count7
Digit sum25
Digit product1,728
Multiplicative persistence3times 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 factorisation7 × 47 × 8,609
Distinct prime factors37, 47, 8,609
Number of divisors8
Sum of divisors σ(n)3,306,240
Aliquot sum473,879sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,375,808integers below n that share no factor with it
Carmichael function λ(n)593,952the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,375,808
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 7, 47, 329, 8,609, 60,263, 404,623, 2,832,3618 in total
Arithmetic
Previous number2,832,360
Next number2,832,362
Double5,664,722
Half1,416,180.5
Square8,022,268,834,321
Cube22,721,961,377,846,261,881
Square root1,682.961972238≈irrational, shown to 9 decimal places
Cube root141.486890452≈
Negation-2,832,361
Reciprocal3.53062339 × 10^-7≈
Representations
Decimal2,832,361
Binary101011001101111110100122 bits
Octal12633751
Hexadecimal2B37E9
Base 361OPGP
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, eight hundred and thirty-two thousand, three hundred and sixty-one
Ordinaltwo million, eight hundred and thirty-two thousand, three hundred and sixty-first
Scientific notation2.832361 × 10^6
Engineering notation2.832361 × 10^6
In other bases
Ternary12022220021021base 3; the most digit-efficient integer base after e: 14 digits
Quinary1211113421base 5; one hand: 10 digits
Septenary33034420base 7: 8 digits
Nonary5286237base 9; each digit is two ternary digits: 7 digits
Duodecimalb47121base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalhe0i1base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal13:6:46:1base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1TT1000T01T11T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11111110100100000111001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001010110011011111101001
Bit length22 bitsto write the magnitude
Set bits14the population count, or Hamming weight
Zero bits8within that length
Bit parityeven14 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
Bytes32b 37 e9
Gray code1111101010110000011101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001010110011011111101001
64-bit0000000000000000000000000000000000000000001010110011011111101001
One's complement11111111110101001100100000010110at 32 bits, every bit flipped
Bits reversed10010111111011001101010000000000at 32 bits
Rotated left by 100000000010101100110111111010010at 32 bits, wrapping
Shifted left by 110101100110111111010010= 5,664,722, no wrap
Shifted right by 1101011001101111110100= 1,416,180, discarding the low bit
These bits as a double1.39937227 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,832,361 to the power 28,022,268,834,321
2,832,361 to the power 322,721,961,377,846,261,881
2,832,361 to the power 464,356,797,250,118,016,147,531,041
2,832,361 to the power 5182,281,682,616,141,514,333,637,166,817,801
First ten multiples2,832,361, 5,664,722, 8,497,083, 11,329,444, 14,161,805, 16,994,166, 19,826,527, 22,658,888, 25,491,249, 28,323,610
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 1
Divisible by 6No, remainder 1
Divisible by 7Yes
Divisible by 8No, remainder 1
Divisible by 9No, remainder 7
Divisible by 10No, remainder 1
Divisible by 11No, remainder 4
Divisible by 12No, remainder 1
Divisible by 100No, remainder 61
Collatz (3n + 1) trajectory
Steps to reach 1107the total stopping time
Highest value reached40,832,08014× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,832,361 → 8,497,084 → 4,248,542 → 2,124,271 → 6,372,814 → 3,186,407 → 9,559,222 → 4,779,611 → 14,338,834 → 7,169,417 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage283,236,100%
2,832,361% as a decimal28,323.61
2,832,361% of 1002,832,361
2,832,361% of 1,00028,323,610
As a fraction of 1002,832,361/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,361
Nerdulate something else
Nothing in mind? Surprise me · today’s page