Recognised as Number
1,998,041
- Positive
- Odd
- Prime
- 7 digits
1,998,041 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 5.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value1,998,041
Digit count7
Digit sum32
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation1,998,041
Distinct prime factors11,998,041
Number of divisors2
Sum of divisors σ(n)1,998,042
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,998,040integers below n that share no factor with it
Carmichael function λ(n)1,998,040the 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, 1,998,0412 in total
Arithmetic
Previous number1,998,040
Next number1,998,042
Double3,996,082
Half999,020.5
Square3,992,167,837,681
Cube7,976,515,018,567,982,921
Square root1,413.520781595≈irrational, shown to 9 decimal places
Cube root125.950955129≈
Negation-1,998,041
Reciprocal5.0049023 × 10^-7≈
Representations
Decimal1,998,041
Binary11110011111001101100121 bits
Octal7476331
Hexadecimal1E7CD9
Base 3616TP5
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, nine hundred and ninety-eight thousand and forty-one
Ordinalone million, nine hundred and ninety-eight thousand and forty-first
Scientific notation1.998041 × 10^6
Engineering notation1.998041 × 10^6
In other bases
Ternary10202111210112base 3; the most digit-efficient integer base after e: 14 digits
Quinary1002414131base 5; one hand: 10 digits
Septenary22661123base 7: 8 digits
Nonary3674715base 9; each digit is two ternary digits: 7 digits
Duodecimal804335base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalc9f21base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal9:15:0:41base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary11T10TTTT11TTTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11000111000110100101001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000111100111110011011001
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 7c d9
Gray code100010100001010110101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000111100111110011011001
64-bit0000000000000000000000000000000000000000000111100111110011011001
One's complement11111111111000011000001100100110at 32 bits, every bit flipped
Bits reversed10011011001111100111100000000000at 32 bits
Rotated left by 100000000001111001111100110110010at 32 bits, wrapping
Shifted left by 11111001111100110110010= 3,996,082, no wrap
Shifted right by 111110011111001101100= 999,020, discarding the low bit
These bits as a double9.87163417 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,998,041 to the power 23,992,167,837,681
1,998,041 to the power 37,976,515,018,567,982,921
1,998,041 to the power 415,937,404,044,214,591,163,457,761
1,998,041 to the power 531,843,586,713,906,565,942,826,308,246,201
First ten multiples1,998,041, 3,996,082, 5,994,123, 7,992,164, 9,990,205, 11,988,246, 13,986,287, 15,984,328, 17,982,369, 19,980,410
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 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 3
Divisible by 8No, remainder 1
Divisible by 9No, remainder 5
Divisible by 10No, remainder 1
Divisible by 11No, remainder 1
Divisible by 12No, remainder 5
Divisible by 100No, remainder 41
Collatz (3n + 1) trajectory
Steps to reach 1140the total stopping time
Highest value reached6,743,3923× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,998,041 → 5,994,124 → 2,997,062 → 1,498,531 → 4,495,594 → 2,247,797 → 6,743,392 → 3,371,696 → 1,685,848 → 842,924 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage199,804,100%
1,998,041% as a decimal19,980.41
1,998,041% of 1001,998,041
1,998,041% of 1,00019,980,410
As a fraction of 1001,998,041/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,998,041
Nerdulate something else
Nothing in mind? Surprise me · today’s page