Recognised as Number
1,678,601
- Positive
- Odd
- Prime
- 7 digits
1,678,601 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value1,678,601
Digit count7
Digit sum29
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation1,678,601
Distinct prime factors11,678,601
Number of divisors2
Sum of divisors σ(n)1,678,602
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,678,600integers below n that share no factor with it
Carmichael function λ(n)1,678,600the 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,678,6012 in total
Arithmetic
Previous number1,678,600
Next number1,678,602
Double3,357,202
Half839,300.5
Square2,817,701,317,201
Cube4,729,796,248,754,915,801
Square root1,295.608351316≈irrational, shown to 9 decimal places
Cube root118.84543169≈
Negation-1,678,601
Reciprocal5.95734186 × 10^-7≈
Representations
Decimal1,678,601
Binary11001100111010000100121 bits
Octal6316411
Hexadecimal199D09
Base 36ZZ7T
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, six hundred and seventy-eight thousand, six hundred and one
Ordinalone million, six hundred and seventy-eight thousand, six hundred and first
Scientific notation1.678601 × 10^6
Engineering notation1.678601 × 10^6
In other bases
Ternary10011021121102base 3; the most digit-efficient integer base after e: 14 digits
Quinary412203401base 5; one hand: 9 digits
Septenary20160611base 7: 8 digits
Nonary3137542base 9; each digit is two ternary digits: 7 digits
Duodecimal68b4b5base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimala9ga1base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal7:46:16:41base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1001110TTT111Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11011101110110100011001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000110011001110100001001
Bit length21 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits11within that length
Bit parityeven10 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 9d 09
Gray code101010101001110001101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000110011001110100001001
64-bit0000000000000000000000000000000000000000000110011001110100001001
One's complement11111111111001100110001011110110at 32 bits, every bit flipped
Bits reversed10010000101110011001100000000000at 32 bits
Rotated left by 100000000001100110011101000010010at 32 bits, wrapping
Shifted left by 11100110011101000010010= 3,357,202, no wrap
Shifted right by 111001100111010000100= 839,300, discarding the low bit
These bits as a double8.29339087 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,678,601 to the power 22,817,701,317,201
1,678,601 to the power 34,729,796,248,754,915,801
1,678,601 to the power 47,939,440,712,956,250,418,474,401
1,678,601 to the power 513,327,153,120,209,074,908,701,547,993,001
First ten multiples1,678,601, 3,357,202, 5,035,803, 6,714,404, 8,393,005, 10,071,606, 11,750,207, 13,428,808, 15,107,409, 16,786,010
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 2
Divisible by 4No, remainder 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 1
Divisible by 8No, remainder 1
Divisible by 9No, remainder 2
Divisible by 10No, remainder 1
Divisible by 11No, remainder 1
Divisible by 12No, remainder 5
Divisible by 100No, remainder 1
Collatz (3n + 1) trajectory
Steps to reach 1158the total stopping time
Highest value reached8,497,9245× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,678,601 → 5,035,804 → 2,517,902 → 1,258,951 → 3,776,854 → 1,888,427 → 5,665,282 → 2,832,641 → 8,497,924 → 4,248,962 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage167,860,100%
1,678,601% as a decimal16,786.01
1,678,601% of 1001,678,601
1,678,601% of 1,00016,786,010
As a fraction of 1001,678,601/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,678,601
Nerdulate something else
Nothing in mind? Surprise me · today’s page