Recognised as Number
6,832,009
- Positive
- Odd
- Prime
- 7 digits
6,832,009 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 value6,832,009
Digit count7
Digit sum28
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times 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 factorisation6,832,009
Distinct prime factors16,832,009
Number of divisors2
Sum of divisors σ(n)6,832,010
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)6,832,008integers below n that share no factor with it
Carmichael function λ(n)6,832,008the 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, 6,832,0092 in total
Arithmetic
Previous number6,832,008
Next number6,832,010
Double13,664,018
Half3,416,004.5
Square46,676,346,976,081
Cube318,893,222,627,708,176,729
Square root2,613.811202057≈irrational, shown to 9 decimal places
Cube root189.750447997≈
Negation-6,832,009
Reciprocal1.46369831 × 10^-7≈
Representations
Decimal6,832,009
Binary1101000001111111000100123 bits
Octal32037611
Hexadecimal683F89
Base 3642FM1
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordssix million, eight hundred and thirty-two thousand and nine
Ordinalsix million, eight hundred and thirty-two thousand and ninth
Scientific notation6.832009 × 10^6
Engineering notation6.832009 × 10^6
In other bases
Ternary110212002202101base 3; the most digit-efficient integer base after e: 15 digits
Quinary3222111014base 5; one hand: 10 digits
Septenary112033252base 7: 9 digits
Nonary13762671base 9; each digit is two ternary digits: 8 digits
Duodecimal2355861base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal22e009base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal31:37:46:49base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1110TT010T1T101digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101110000100000010011001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000011010000011111110001001
Bit length23 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits11within that length
Bit parityeven12 set bits, so even; not the same as the number itself being odd
Highest set bitbit 22worth 4,194,304
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes368 3f 89
Gray code10111000010000001001101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000011010000011111110001001
64-bit0000000000000000000000000000000000000000011010000011111110001001
One's complement11111111100101111100000001110110at 32 bits, every bit flipped
Bits reversed10010001111111000001011000000000at 32 bits
Rotated left by 100000000110100000111111100010010at 32 bits, wrapping
Shifted left by 1110100000111111100010010= 13,664,018, no wrap
Shifted right by 11101000001111111000100= 3,416,004, discarding the low bit
These bits as a double3.37546094 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
6,832,009 to the power 246,676,346,976,081
6,832,009 to the power 3318,893,222,627,708,176,729
6,832,009 to the power 42,178,681,367,031,505,912,786,118,561
6,832,009 to the power 514,884,770,707,691,551,679,707,977,083,819,049
First ten multiples6,832,009, 13,664,018, 20,496,027, 27,328,036, 34,160,045, 40,992,054, 47,824,063, 54,656,072, 61,488,081, 68,320,090
Powers of twoBetween 2^22 (4,194,304) and 2^23 (8,388,608)
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 2
Divisible by 8No, remainder 1
Divisible by 9No, remainder 1
Divisible by 10No, remainder 9
Divisible by 11No, remainder 8
Divisible by 12No, remainder 1
Divisible by 100No, remainder 9
Collatz (3n + 1) trajectory
Steps to reach 1240the total stopping time
Highest value reached74,876,88410× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps6,832,009 → 20,496,028 → 10,248,014 → 5,124,007 → 15,372,022 → 7,686,011 → 23,058,034 → 11,529,017 → 34,587,052 → 17,293,526 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage683,200,900%
6,832,009% as a decimal68,320.09
6,832,009% of 1006,832,009
6,832,009% of 1,00068,320,090
As a fraction of 1006,832,009/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 6,832,009
Nerdulate something else
Nothing in mind? Surprise me · today’s page