Recognised as Number
6,828,071
- Positive
- Odd
- Prime
- 7 digits
6,828,071 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 value6,828,071
Digit count7
Digit sum32
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times 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 factorisation6,828,071
Distinct prime factors16,828,071
Number of divisors2
Sum of divisors σ(n)6,828,072
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)6,828,070integers below n that share no factor with it
Carmichael function λ(n)6,828,070the 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,828,0712 in total
Arithmetic
Previous number6,828,070
Next number6,828,072
Double13,656,142
Half3,414,035.5
Square46,622,553,581,041
Cube318,342,106,052,652,201,911
Square root2,613.057787344≈irrational, shown to 9 decimal places
Cube root189.713983326≈
Negation-6,828,071
Reciprocal1.46454247 × 10^-7≈
Representations
Decimal6,828,071
Binary1101000001100000010011123 bits
Octal32030047
Hexadecimal683027
Base 3642CKN
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordssix million, eight hundred and twenty-eight thousand and seventy-one
Ordinalsix million, eight hundred and twenty-eight thousand and seventy-first
Scientific notation6.828071 × 10^6
Engineering notation6.828071 × 10^6
In other bases
Ternary110211220100112base 3; the most digit-efficient integer base after e: 15 digits
Quinary3221444241base 5; one hand: 10 digits
Septenary112015625base 7: 9 digits
Nonary13756315base 9; each digit is two ternary digits: 8 digits
Duodecimal235351bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal22da3bbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal31:36:41:11base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1110TT0T0101TTTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101110000111000001111011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000011010000011000000100111
Bit length23 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits14within that length
Bit parityodd9 set bits, so odd; 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 30 27
Gray code10111000010100000110100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000011010000011000000100111
64-bit0000000000000000000000000000000000000000011010000011000000100111
One's complement11111111100101111100111111011000at 32 bits, every bit flipped
Bits reversed11100100000011000001011000000000at 32 bits
Rotated left by 100000000110100000110000001001110at 32 bits, wrapping
Shifted left by 1110100000110000001001110= 13,656,142, no wrap
Shifted right by 11101000001100000010011= 3,414,035, discarding the low bit
These bits as a double3.37351531 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
6,828,071 to the power 246,622,553,581,041
6,828,071 to the power 3318,342,106,052,652,201,911
6,828,071 to the power 42,173,662,502,417,038,972,954,643,681
6,828,071 to the power 514,841,921,896,541,213,717,101,386,833,569,351
First ten multiples6,828,071, 13,656,142, 20,484,213, 27,312,284, 34,140,355, 40,968,426, 47,796,497, 54,624,568, 61,452,639, 68,280,710
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 2
Divisible by 4No, remainder 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 5
Divisible by 8No, remainder 7
Divisible by 9No, remainder 5
Divisible by 10No, remainder 1
Divisible by 11No, remainder 8
Divisible by 12No, remainder 11
Divisible by 100No, remainder 71
Collatz (3n + 1) trajectory
Steps to reach 1129the total stopping time
Highest value reached51,850,6727× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps6,828,071 → 20,484,214 → 10,242,107 → 30,726,322 → 15,363,161 → 46,089,484 → 23,044,742 → 11,522,371 → 34,567,114 → 17,283,557 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage682,807,100%
6,828,071% as a decimal68,280.71
6,828,071% of 1006,828,071
6,828,071% of 1,00068,280,710
As a fraction of 1006,828,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 6,828,071
Nerdulate something else
Nothing in mind? Surprise me · today’s page