Recognised as Number
1,671,775
- Positive
- Odd
- Composite
- 7 digits
1,671,775 is an odd 7-digit integer and a composite number. It has 24 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,671,775
Digit count7
Digit sum34
Digit product10,290
Multiplicative persistence2times 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 factorisation5^2 × 7 × 41 × 233
Distinct prime factors45, 7, 41, 233
Number of divisors24
Sum of divisors σ(n)2,437,344
Aliquot sum765,569sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,113,600integers below n that share no factor with it
Carmichael function λ(n)3,480the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,113,600
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 5, 7, 25, 35, 41, 175, 205, 233, 287, 1,025, 1,165, 1,435, 1,631, 5,825, 7,175, 8,155, 9,553, 40,775, 47,765, 66,871, 238,825, 334,355, 1,671,77524 in total
Arithmetic
Previous number1,671,774
Next number1,671,776
Double3,343,550
Half835,887.5
Square2,794,831,650,625
Cube4,672,329,682,723,609,375
Square root1,292.971384061≈irrational, shown to 9 decimal places
Cube root118.684118581≈
Negation-1,671,775
Reciprocal5.98166619 × 10^-7≈
Representations
Decimal1,671,775
Binary11001100000100101111121 bits
Octal6301137
Hexadecimal19825F
Base 36ZTY7
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, six hundred and seventy-one thousand, seven hundred and seventy-five
Ordinalone million, six hundred and seventy-one thousand, seven hundred and seventy-fifth
Scientific notation1.671775 × 10^6
Engineering notation1.671775 × 10^6
In other bases
Ternary10010221020121base 3; the most digit-efficient integer base after e: 14 digits
Quinary411444100base 5; one hand: 9 digits
Septenary20131660base 7: 8 digits
Nonary3127217base 9; each digit is two ternary digits: 7 digits
Duodecimal687567base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimala8j8fbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal7:44:22:55base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary100110T11T1TT1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11011101000011110100011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000110011000001001011111
Bit length21 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits10within that length
Bit parityodd11 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 82 5f
Gray code101010100001101110000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000110011000001001011111
64-bit0000000000000000000000000000000000000000000110011000001001011111
One's complement11111111111001100111110110100000at 32 bits, every bit flipped
Bits reversed11111010010000011001100000000000at 32 bits
Rotated left by 100000000001100110000010010111110at 32 bits, wrapping
Shifted left by 11100110000010010111110= 3,343,550, no wrap
Shifted right by 111001100000100101111= 835,887, discarding the low bit
These bits as a double8.25966595 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,671,775 to the power 22,794,831,650,625
1,671,775 to the power 34,672,329,682,723,609,375
1,671,775 to the power 47,811,083,955,335,262,062,890,625
1,671,775 to the power 513,058,374,879,430,607,735,188,974,609,375
First ten multiples1,671,775, 3,343,550, 5,015,325, 6,687,100, 8,358,875, 10,030,650, 11,702,425, 13,374,200, 15,045,975, 16,717,750
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 3
Divisible by 5Yes
Divisible by 6No, remainder 1
Divisible by 7Yes
Divisible by 8No, remainder 7
Divisible by 9No, remainder 7
Divisible by 10No, remainder 5
Divisible by 11No, remainder 6
Divisible by 12No, remainder 7
Divisible by 100No, remainder 75
Collatz (3n + 1) trajectory
Steps to reach 1207the total stopping time
Highest value reached25,390,09615× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,671,775 → 5,015,326 → 2,507,663 → 7,522,990 → 3,761,495 → 11,284,486 → 5,642,243 → 16,926,730 → 8,463,365 → 25,390,096 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage167,177,500%
1,671,775% as a decimal16,717.75
1,671,775% of 1001,671,775
1,671,775% of 1,00016,717,750
As a fraction of 1001,671,775/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,671,775
Nerdulate something else
Nothing in mind? Surprise me · today’s page