Recognised as Number
1,047,682
- Positive
- Even
- Composite
- 7 digits
1,047,682 is an even 7-digit integer and a composite number. It has 8 divisors and a digital root of 1.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,047,682
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 factorisation2 × 607 × 863
Distinct prime factors32, 607, 863
Number of divisors8
Sum of divisors σ(n)1,575,936
Aliquot sum528,254sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)522,372integers below n that share no factor with it
Carmichael function λ(n)261,186the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 522,372
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 607, 863, 1,214, 1,726, 523,841, 1,047,6828 in total
Arithmetic
Previous number1,047,681
Next number1,047,683
Double2,095,364
Half523,841
Square1,097,637,573,124
Cube1,149,975,127,885,698,568
Square root1,023.563383479≈irrational, shown to 9 decimal places
Cube root101.56478671≈
Negation-1,047,682
Reciprocal9.54488098 × 10^-7≈
Representations
Decimal1,047,682
Binary1111111111001000001020 bits
Octal3776202
HexadecimalFFC82
Base 36MGEA
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, forty-seven thousand, six hundred and eighty-two
Ordinalone million, forty-seven thousand, six hundred and eighty-second
Scientific notation1.047682 × 10^6
Engineering notation1.047682 × 10^6
In other bases
Ternary1222020011001base 3; the most digit-efficient integer base after e: 13 digits
Quinary232011212base 5; one hand: 9 digits
Septenary11622316base 7: 8 digits
Nonary1866131base 9; each digit is two ternary digits: 7 digits
Duodecimal42636abase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal6aj42base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal4:51:1:22base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T00T1T0011001digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100000000110110000110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000011111111110010000010
Bit length20 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits8within that length
Bit parityeven12 set bits, so even; not the same as the number itself being even
Highest set bitbit 19worth 524,288
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes30f fc 82
Gray code10000000001011000011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000011111111110010000010
64-bit0000000000000000000000000000000000000000000011111111110010000010
One's complement11111111111100000000001101111101at 32 bits, every bit flipped
Bits reversed01000001001111111111000000000000at 32 bits
Rotated left by 100000000000111111111100100000100at 32 bits, wrapping
Shifted left by 1111111111100100000100= 2,095,364, no wrap
Shifted right by 11111111111001000001= 523,841, discarding the low bit
These bits as a double5.17623684 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,047,682 to the power 21,097,637,573,124
1,047,682 to the power 31,149,975,127,885,698,568
1,047,682 to the power 41,204,808,241,933,544,447,119,376
1,047,682 to the power 51,262,255,908,525,419,713,446,922,086,432
First ten multiples1,047,682, 2,095,364, 3,143,046, 4,190,728, 5,238,410, 6,286,092, 7,333,774, 8,381,456, 9,429,138, 10,476,820
Powers of twoBetween 2^19 (524,288) and 2^20 (1,048,576)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 1
Divisible by 4No, remainder 2
Divisible by 5No, remainder 2
Divisible by 6No, remainder 4
Divisible by 7No, remainder 6
Divisible by 8No, remainder 2
Divisible by 9No, remainder 1
Divisible by 10No, remainder 2
Divisible by 11No, remainder 9
Divisible by 12No, remainder 10
Divisible by 100No, remainder 82
Collatz (3n + 1) trajectory
Steps to reach 1134the total stopping time
Highest value reached1,571,5241× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,047,682 → 523,841 → 1,571,524 → 785,762 → 392,881 → 1,178,644 → 589,322 → 294,661 → 883,984 → 441,992 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage104,768,200%
1,047,682% as a decimal10,476.82
1,047,682% of 1001,047,682
1,047,682% of 1,00010,476,820
As a fraction of 1001,047,682/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 1,047,682
Nerdulate something else
Nothing in mind? Surprise me · today’s page