Recognised as Number
2,007,197
- Positive
- Odd
- Composite
- 7 digits
2,007,197 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 8.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value2,007,197
Digit count7
Digit sum26
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation43 × 46,679
Distinct prime factors243, 46,679
Number of divisors4
Sum of divisors σ(n)2,053,920
Aliquot sum46,723sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,960,476integers below n that share no factor with it
Carmichael function λ(n)980,238the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,960,476
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 43, 46,679, 2,007,1974 in total
Arithmetic
Previous number2,007,196
Next number2,007,198
Double4,014,394
Half1,003,598.5
Square4,028,839,796,809
Cube8,086,675,153,635,634,373
Square root1,416.755801117≈irrational, shown to 9 decimal places
Cube root126.143051603≈
Negation-2,007,197
Reciprocal4.98207201 × 10^-7≈
Representations
Decimal2,007,197
Binary11110101000001001110121 bits
Octal7520235
Hexadecimal1EA09D
Base 36170RH
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, seven thousand, one hundred and ninety-seven
Ordinaltwo million, seven thousand, one hundred and ninety-seventh
Scientific notation2.007197 × 10^6
Engineering notation2.007197 × 10^6
In other bases
Ternary10202222100122base 3; the most digit-efficient integer base after e: 14 digits
Quinary1003212242base 5; one hand: 10 digits
Septenary23026613base 7: 8 digits
Nonary3688318base 9; each digit is two ternary digits: 7 digits
Duodecimal8096a5base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalcahjhbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal9:17:33:17base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary11T1000T101T0Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11000111110000111101101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000111101010000010011101
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
Bytes31e a0 9d
Gray code100011111000011010011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000111101010000010011101
64-bit0000000000000000000000000000000000000000000111101010000010011101
One's complement11111111111000010101111101100010at 32 bits, every bit flipped
Bits reversed10111001000001010111100000000000at 32 bits
Rotated left by 100000000001111010100000100111010at 32 bits, wrapping
Shifted left by 11111010100000100111010= 4,014,394, no wrap
Shifted right by 111110101000001001110= 1,003,598, discarding the low bit
These bits as a double9.91687082 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,007,197 to the power 24,028,839,796,809
2,007,197 to the power 38,086,675,153,635,634,373
2,007,197 to the power 416,231,550,108,351,984,406,582,481
2,007,197 to the power 532,579,918,682,833,778,044,939,136,115,757
First ten multiples2,007,197, 4,014,394, 6,021,591, 8,028,788, 10,035,985, 12,043,182, 14,050,379, 16,057,576, 18,064,773, 20,071,970
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 2
Divisible by 6No, remainder 5
Divisible by 7No, remainder 3
Divisible by 8No, remainder 5
Divisible by 9No, remainder 8
Divisible by 10No, remainder 7
Divisible by 11No, remainder 5
Divisible by 12No, remainder 5
Divisible by 100No, remainder 97
Collatz (3n + 1) trajectory
Steps to reach 1197the total stopping time
Highest value reached6,021,5923× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,007,197 → 6,021,592 → 3,010,796 → 1,505,398 → 752,699 → 2,258,098 → 1,129,049 → 3,387,148 → 1,693,574 → 846,787 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage200,719,700%
2,007,197% as a decimal20,071.97
2,007,197% of 1002,007,197
2,007,197% of 1,00020,071,970
As a fraction of 1002,007,197/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,197
Nerdulate something else
Nothing in mind? Surprise me · today’s page