Recognised as Number
1,672,663
- Positive
- Odd
- Prime
- 7 digits
1,672,663 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value1,672,663
Digit count7
Digit sum31
Digit product9,072
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation1,672,663
Distinct prime factors11,672,663
Number of divisors2
Sum of divisors σ(n)1,672,664
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,672,662integers below n that share no factor with it
Carmichael function λ(n)1,672,662the 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, 1,672,6632 in total
Arithmetic
Previous number1,672,662
Next number1,672,664
Double3,345,326
Half836,331.5
Square2,797,801,511,569
Cube4,679,779,069,745,538,247
Square root1,293.314733543≈irrational, shown to 9 decimal places
Cube root118.705128753≈
Negation-1,672,663
Reciprocal5.97849059 × 10^-7≈
Representations
Decimal1,672,663
Binary11001100001011101011121 bits
Octal6302727
Hexadecimal1985D7
Base 36ZUMV
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, six hundred and seventy-two thousand, six hundred and sixty-three
Ordinalone million, six hundred and seventy-two thousand, six hundred and sixty-third
Scientific notation1.672663 × 10^6
Engineering notation1.672663 × 10^6
In other bases
Ternary10010222110111base 3; the most digit-efficient integer base after e: 14 digits
Quinary412011123base 5; one hand: 9 digits
Septenary20134366base 7: 8 digits
Nonary3128414base 9; each digit is two ternary digits: 7 digits
Duodecimal687b87base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimala91d3base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal7:44:37:43base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1001100T110111digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11011101001101000101011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000110011000010111010111
Bit length21 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits9within that length
Bit parityeven12 set bits, so even; 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 85 d7
Gray code101010100011100111100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000110011000010111010111
64-bit0000000000000000000000000000000000000000000110011000010111010111
One's complement11111111111001100111101000101000at 32 bits, every bit flipped
Bits reversed11101011101000011001100000000000at 32 bits
Rotated left by 100000000001100110000101110101110at 32 bits, wrapping
Shifted left by 11100110000101110101110= 3,345,326, no wrap
Shifted right by 111001100001011101011= 836,331, discarding the low bit
These bits as a double8.26405325 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,672,663 to the power 22,797,801,511,569
1,672,663 to the power 34,679,779,069,745,538,247
1,672,663 to the power 47,827,693,298,137,781,240,841,761
1,672,663 to the power 513,093,092,955,143,035,583,650,102,479,543
First ten multiples1,672,663, 3,345,326, 5,017,989, 6,690,652, 8,363,315, 10,035,978, 11,708,641, 13,381,304, 15,053,967, 16,726,630
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 5No, remainder 3
Divisible by 6No, remainder 1
Divisible by 7No, remainder 6
Divisible by 8No, remainder 7
Divisible by 9No, remainder 4
Divisible by 10No, remainder 3
Divisible by 11No, remainder 3
Divisible by 12No, remainder 7
Divisible by 100No, remainder 63
Collatz (3n + 1) trajectory
Steps to reach 157the total stopping time
Highest value reached11,290,4806× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,672,663 → 5,017,990 → 2,508,995 → 7,526,986 → 3,763,493 → 11,290,480 → 5,645,240 → 2,822,620 → 1,411,310 → 705,655 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage167,266,300%
1,672,663% as a decimal16,726.63
1,672,663% of 1001,672,663
1,672,663% of 1,00016,726,630
As a fraction of 1001,672,663/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,672,663
Nerdulate something else
Nothing in mind? Surprise me · today’s page