Recognised as Number
1,997,200
- Positive
- Even
- Composite
- 7 digits
1,997,200 is an even 7-digit integer and a composite number. It has 30 divisors and a digital root of 1.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,997,200
Digit count7
Digit sum28
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2^4 × 5^2 × 4,993
Distinct prime factors32, 5, 4,993
Number of divisors30
Sum of divisors σ(n)4,799,234
Aliquot sum2,802,034sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)798,720integers below n that share no factor with it
Carmichael function λ(n)24,960the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 798,720
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 5, 8, 10, 16, 20, 25, 40, 50, 80, 100, 200, 400, 4,993, 9,986, 19,972, 24,965, 39,944, 49,930, 79,888, 99,860, 124,825, 199,720, 249,650, 399,440, 499,300, 998,600, 1,997,20030 in total
Arithmetic
Previous number1,997,199
Next number1,997,201
Double3,994,400
Half998,600
Square3,988,807,840,000
Cube7,966,447,018,048,000,000
Square root1,413.223266154≈irrational, shown to 9 decimal places
Cube root125.933281214≈
Negation-1,997,200
Reciprocal5.00700981 × 10^-7≈
Representations
Decimal1,997,200
Binary11110011110011001000021 bits
Octal7474620
Hexadecimal1E7990
Base 3616T1S
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, nine hundred and ninety-seven thousand, two hundred
Ordinalone million, nine hundred and ninety-seven thousand, two hundredth
Scientific notation1.9972 × 10^6
Engineering notation1.9972 × 10^6
In other bases
Ternary10202110122101base 3; the most digit-efficient integer base after e: 14 digits
Quinary1002402300base 5; one hand: 10 digits
Septenary22655512base 7: 8 digits
Nonary3673571base 9; each digit is two ternary digits: 7 digits
Duodecimal803954base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalc9d00base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal9:14:46:40base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary11T1T111T0T101digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11000111000111010010000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000111100111100110010000
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 even
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 44 trailing zeros
Power of twoNo
Bytes31e 79 90
Gray code100010100010101011000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000111100111100110010000
64-bit0000000000000000000000000000000000000000000111100111100110010000
One's complement11111111111000011000011001101111at 32 bits, every bit flipped
Bits reversed00001001100111100111100000000000at 32 bits
Rotated left by 100000000001111001111001100100000at 32 bits, wrapping
Shifted left by 11111001111001100100000= 3,994,400, no wrap
Shifted right by 111110011110011001000= 998,600, discarding the low bit
These bits as a double9.86747908 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,997,200 to the power 23,988,807,840,000
1,997,200 to the power 37,966,447,018,048,000,000
1,997,200 to the power 415,910,587,984,445,465,600,000,000
1,997,200 to the power 531,776,626,322,534,483,896,320,000,000,000
First ten multiples1,997,200, 3,994,400, 5,991,600, 7,988,800, 9,986,000, 11,983,200, 13,980,400, 15,977,600, 17,974,800, 19,972,000
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 1
Divisible by 4Yes
Divisible by 5Yes
Divisible by 6No, remainder 4
Divisible by 7No, remainder 2
Divisible by 8Yes
Divisible by 9No, remainder 1
Divisible by 10Yes
Divisible by 11No, remainder 7
Divisible by 12No, remainder 4
Divisible by 100Yes
Collatz (3n + 1) trajectory
Steps to reach 1153the total stopping time
Highest value reached1,997,200
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,997,200 → 998,600 → 499,300 → 249,650 → 124,825 → 374,476 → 187,238 → 93,619 → 280,858 → 140,429 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage199,720,000%
1,997,200% as a decimal19,972
1,997,200% of 1001,997,200
1,997,200% of 1,00019,972,000
As a fraction of 1001,997,200/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,997,200
Nerdulate something else
Nothing in mind? Surprise me · today’s page