Recognised as Number
1,997,238
- Positive
- Even
- Composite
- 7 digits
1,997,238 is an even 7-digit integer and a composite number. It has 8 divisors and a digital root of 3.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,997,238
Digit count7
Digit sum39
Digit product27,216
Multiplicative persistence5times the digit product can be taken before one digit is left
Digital root3repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2 × 3 × 332,873
Distinct prime factors32, 3, 332,873
Number of divisors8
Sum of divisors σ(n)3,994,488
Aliquot sum1,997,250sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)665,744integers below n that share no factor with it
Carmichael function λ(n)332,872the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 665,744
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 3, 6, 332,873, 665,746, 998,619, 1,997,2388 in total
Arithmetic
Previous number1,997,237
Next number1,997,239
Double3,994,476
Half998,619
Square3,988,959,628,644
Cube7,966,901,750,793,685,272
Square root1,413.236710534≈irrational, shown to 9 decimal places
Cube root125.934079905≈
Negation-1,997,238
Reciprocal5.00691455 × 10^-7≈
Representations
Decimal1,997,238
Binary11110011110011011011021 bits
Octal7474666
Hexadecimal1E79B6
Base 3616T2U
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, nine hundred and ninety-seven thousand, two hundred and thirty-eight
Ordinalone million, nine hundred and ninety-seven thousand, two hundred and thirty-eighth
Scientific notation1.997238 × 10^6
Engineering notation1.997238 × 10^6
In other bases
Ternary10202110200210base 3; the most digit-efficient integer base after e: 14 digits
Quinary1002402423base 5; one hand: 10 digits
Septenary22655565base 7: 8 digits
Nonary3673623base 9; each digit is two ternary digits: 7 digits
Duodecimal803986base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalc9d1ibase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal9:14:47:18base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary11T1T111T01T10digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11000111000111011001010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000111100111100110110110
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 even
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes31e 79 b6
Gray code100010100010101101101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000111100111100110110110
64-bit0000000000000000000000000000000000000000000111100111100110110110
One's complement11111111111000011000011001001001at 32 bits, every bit flipped
Bits reversed01101101100111100111100000000000at 32 bits
Rotated left by 100000000001111001111001101101100at 32 bits, wrapping
Shifted left by 11111001111001101101100= 3,994,476, no wrap
Shifted right by 111110011110011011011= 998,619, discarding the low bit
These bits as a double9.86766682 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,997,238 to the power 23,988,959,628,644
1,997,238 to the power 37,966,901,750,793,685,272
1,997,238 to the power 415,911,798,918,951,678,385,278,736
1,997,238 to the power 531,779,649,449,289,212,234,857,332,131,168
First ten multiples1,997,238, 3,994,476, 5,991,714, 7,988,952, 9,986,190, 11,983,428, 13,980,666, 15,977,904, 17,975,142, 19,972,380
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2Yes
Divisible by 3Yes
Divisible by 4No, remainder 2
Divisible by 5No, remainder 3
Divisible by 6Yes
Divisible by 7No, remainder 5
Divisible by 8No, remainder 6
Divisible by 9No, remainder 3
Divisible by 10No, remainder 8
Divisible by 11No, remainder 1
Divisible by 12No, remainder 6
Divisible by 100No, remainder 38
Collatz (3n + 1) trajectory
Steps to reach 1184the total stopping time
Highest value reached7,583,2723× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,997,238 → 998,619 → 2,995,858 → 1,497,929 → 4,493,788 → 2,246,894 → 1,123,447 → 3,370,342 → 1,685,171 → 5,055,514 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage199,723,800%
1,997,238% as a decimal19,972.38
1,997,238% of 1001,997,238
1,997,238% of 1,00019,972,380
As a fraction of 1001,997,238/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,238
Nerdulate something else
Nothing in mind? Surprise me · today’s page