Recognised as Number
2,007,639
- Positive
- Odd
- Composite
- 7 digits
2,007,639 is an odd 7-digit integer and a composite number. It has 8 divisors and a digital root of 9.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value2,007,639
Digit count7
Digit sum27
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberYesdivisible by its own digit sum
Factors & divisors
Prime factorisation3^3 × 74,357
Distinct prime factors23, 74,357
Number of divisors8
Sum of divisors σ(n)2,974,320
Aliquot sum966,681sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,338,408integers below n that share no factor with it
Carmichael function λ(n)669,204the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,338,408
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 3, 9, 27, 74,357, 223,071, 669,213, 2,007,6398 in total
Arithmetic
Previous number2,007,638
Next number2,007,640
Double4,015,278
Half1,003,819.5
Square4,030,614,354,321
Cube8,092,018,571,694,658,119
Square root1,416.911782716≈irrational, shown to 9 decimal places
Cube root126.152310143≈
Negation-2,007,639
Reciprocal4.98097517 × 10^-7≈
Representations
Decimal2,007,639
Binary11110101000100101011121 bits
Octal7521127
Hexadecimal1EA257
Base 361713R
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, seven thousand, six hundred and thirty-nine
Ordinaltwo million, seven thousand, six hundred and thirty-ninth
Scientific notation2.007639 × 10^6
Engineering notation2.007639 × 10^6
In other bases
Ternary10202222222000base 3; the most digit-efficient integer base after e: 14 digits
Quinary1003221024base 5; one hand: 10 digits
Septenary23031114base 7: 8 digits
Nonary3688860base 9; each digit is two ternary digits: 7 digits
Duodecimal8099b3base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalcaj1jbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal9:17:40:39base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary11T1000000T000digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11000111110011110101011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000111101010001001010111
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
Bytes31e a2 57
Gray code100011111001101111100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000111101010001001010111
64-bit0000000000000000000000000000000000000000000111101010001001010111
One's complement11111111111000010101110110101000at 32 bits, every bit flipped
Bits reversed11101010010001010111100000000000at 32 bits
Rotated left by 100000000001111010100010010101110at 32 bits, wrapping
Shifted left by 11111010100010010101110= 4,015,278, no wrap
Shifted right by 111110101000100101011= 1,003,819, discarding the low bit
These bits as a double9.91905459 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,007,639 to the power 24,030,614,354,321
2,007,639 to the power 38,092,018,571,694,658,119
2,007,639 to the power 416,245,852,073,258,491,731,371,041
2,007,639 to the power 532,615,806,210,504,605,081,078,025,382,199
First ten multiples2,007,639, 4,015,278, 6,022,917, 8,030,556, 10,038,195, 12,045,834, 14,053,473, 16,061,112, 18,068,751, 20,076,390
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 3
Divisible by 5No, remainder 4
Divisible by 6No, remainder 3
Divisible by 7No, remainder 4
Divisible by 8No, remainder 7
Divisible by 9Yes
Divisible by 10No, remainder 9
Divisible by 11No, remainder 7
Divisible by 12No, remainder 3
Divisible by 100No, remainder 39
Collatz (3n + 1) trajectory
Steps to reach 191the total stopping time
Highest value reached13,551,5686× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,007,639 → 6,022,918 → 3,011,459 → 9,034,378 → 4,517,189 → 13,551,568 → 6,775,784 → 3,387,892 → 1,693,946 → 846,973 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage200,763,900%
2,007,639% as a decimal20,076.39
2,007,639% of 1002,007,639
2,007,639% of 1,00020,076,390
As a fraction of 1002,007,639/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,639
Nerdulate something else
Nothing in mind? Surprise me · today’s page