Recognised as Number
2,007,679
- Positive
- Odd
- Prime
- 7 digits
2,007,679 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 value2,007,679
Digit count7
Digit sum31
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2,007,679
Distinct prime factors12,007,679
Number of divisors2
Sum of divisors σ(n)2,007,680
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,007,678integers below n that share no factor with it
Carmichael function λ(n)2,007,678the 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, 2,007,6792 in total
Arithmetic
Previous number2,007,678
Next number2,007,680
Double4,015,358
Half1,003,839.5
Square4,030,774,967,041
Cube8,092,502,255,053,907,839
Square root1,416.925897851≈irrational, shown to 9 decimal places
Cube root126.153147953≈
Negation-2,007,679
Reciprocal4.98087593 × 10^-7≈
Representations
Decimal2,007,679
Binary11110101000100111111121 bits
Octal7521177
Hexadecimal1EA27F
Base 361714V
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, seven thousand, six hundred and seventy-nine
Ordinaltwo million, seven thousand, six hundred and seventy-ninth
Scientific notation2.007679 × 10^6
Engineering notation2.007679 × 10^6
In other bases
Ternary10210000000111base 3; the most digit-efficient integer base after e: 14 digits
Quinary1003221204base 5; one hand: 10 digits
Septenary23031202base 7: 8 digits
Nonary3700014base 9; each digit is two ternary digits: 7 digits
Duodecimal809a27base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalcaj3jbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal9:17:41:19base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary11T10000000111digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11000111110011110000011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000111101010001001111111
Bit length21 bitsto write the magnitude
Set bits14the population count, or Hamming weight
Zero bits7within that length
Bit parityeven14 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
Bytes31e a2 7f
Gray code100011111001101000000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000111101010001001111111
64-bit0000000000000000000000000000000000000000000111101010001001111111
One's complement11111111111000010101110110000000at 32 bits, every bit flipped
Bits reversed11111110010001010111100000000000at 32 bits
Rotated left by 100000000001111010100010011111110at 32 bits, wrapping
Shifted left by 11111010100010011111110= 4,015,358, no wrap
Shifted right by 111110101000100111111= 1,003,839, discarding the low bit
These bits as a double9.91925222 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,007,679 to the power 24,030,774,967,041
2,007,679 to the power 38,092,502,255,053,907,839
2,007,679 to the power 416,247,146,834,924,374,636,295,681
2,007,679 to the power 532,619,055,510,394,133,545,423,476,534,399
First ten multiples2,007,679, 4,015,358, 6,023,037, 8,030,716, 10,038,395, 12,046,074, 14,053,753, 16,061,432, 18,069,111, 20,076,790
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 4
Divisible by 6No, remainder 1
Divisible by 7No, remainder 2
Divisible by 8No, remainder 7
Divisible by 9No, remainder 4
Divisible by 10No, remainder 9
Divisible by 11No, remainder 3
Divisible by 12No, remainder 7
Divisible by 100No, remainder 79
Collatz (3n + 1) trajectory
Steps to reach 1272the total stopping time
Highest value reached297,048,544147× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,007,679 → 6,023,038 → 3,011,519 → 9,034,558 → 4,517,279 → 13,551,838 → 6,775,919 → 20,327,758 → 10,163,879 → 30,491,638 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage200,767,900%
2,007,679% as a decimal20,076.79
2,007,679% of 1002,007,679
2,007,679% of 1,00020,076,790
As a fraction of 1002,007,679/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 2,007,679
Nerdulate something else
Nothing in mind? Surprise me · today’s page