Recognised as Number
1,683,649
- Positive
- Odd
- Composite
- 7 digits
1,683,649 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,683,649
Digit count7
Digit sum37
Digit product31,104
Multiplicative persistence2times 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 factorisation11 × 153,059
Distinct prime factors211, 153,059
Number of divisors4
Sum of divisors σ(n)1,836,720
Aliquot sum153,071sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,530,580integers below n that share no factor with it
Carmichael function λ(n)765,290the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,530,580
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 11, 153,059, 1,683,6494 in total
Arithmetic
Previous number1,683,648
Next number1,683,650
Double3,367,298
Half841,824.5
Square2,834,673,955,201
Cube4,772,595,970,000,208,449
Square root1,297.555008468≈irrational, shown to 9 decimal places
Cube root118.964445749≈
Negation-1,683,649
Reciprocal5.93948026 × 10^-7≈
Representations
Decimal1,683,649
Binary11001101100001100000121 bits
Octal6330301
Hexadecimal19B0C1
Base 3610341
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, six hundred and eighty-three thousand, six hundred and forty-nine
Ordinalone million, six hundred and eighty-three thousand, six hundred and forty-ninth
Scientific notation1.683649 × 10^6
Engineering notation1.683649 × 10^6
In other bases
Ternary10011112112101base 3; the most digit-efficient integer base after e: 14 digits
Quinary412334044base 5; one hand: 9 digits
Septenary20211412base 7: 8 digits
Nonary3145471base 9; each digit is two ternary digits: 7 digits
Duodecimal692401base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalaa929base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal7:47:40:49base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary101TTTT0TTT101digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11011101111000111000001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000110011011000011000001
Bit length21 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits12within that length
Bit parityodd9 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes319 b0 c1
Gray code101010110100010100001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000110011011000011000001
64-bit0000000000000000000000000000000000000000000110011011000011000001
One's complement11111111111001100100111100111110at 32 bits, every bit flipped
Bits reversed10000011000011011001100000000000at 32 bits
Rotated left by 100000000001100110110000110000010at 32 bits, wrapping
Shifted left by 11100110110000110000010= 3,367,298, no wrap
Shifted right by 111001101100001100000= 841,824, discarding the low bit
These bits as a double8.31833131 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,683,649 to the power 22,834,673,955,201
1,683,649 to the power 34,772,595,970,000,208,449
1,683,649 to the power 48,035,376,432,294,880,954,950,401
1,683,649 to the power 513,528,753,494,856,844,024,921,287,693,249
First ten multiples1,683,649, 3,367,298, 5,050,947, 6,734,596, 8,418,245, 10,101,894, 11,785,543, 13,469,192, 15,152,841, 16,836,490
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
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 11Yes
Divisible by 12No, remainder 1
Divisible by 100No, remainder 49
Collatz (3n + 1) trajectory
Steps to reach 1106the total stopping time
Highest value reached5,050,9483× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,683,649 → 5,050,948 → 2,525,474 → 1,262,737 → 3,788,212 → 1,894,106 → 947,053 → 2,841,160 → 1,420,580 → 710,290 → …
Last steps… → 32 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage168,364,900%
1,683,649% as a decimal16,836.49
1,683,649% of 1001,683,649
1,683,649% of 1,00016,836,490
As a fraction of 1001,683,649/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,683,649
Nerdulate something else
Nothing in mind? Surprise me · today’s page