Recognised as Number
1,998,045
- Positive
- Odd
- Composite
- 7 digits
1,998,045 is an odd 7-digit integer and a composite number. It has 24 divisors and a digital root of 9.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,998,045
Digit count7
Digit sum36
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 numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3^2 × 5 × 7 × 6,343
Distinct prime factors43, 5, 7, 6,343
Number of divisors24
Sum of divisors σ(n)3,958,656
Aliquot sum1,960,611sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)913,248integers below n that share no factor with it
Carmichael function λ(n)12,684the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 913,248
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 3, 5, 7, 9, 15, 21, 35, 45, 63, 105, 315, 6,343, 19,029, 31,715, 44,401, 57,087, 95,145, 133,203, 222,005, 285,435, 399,609, 666,015, 1,998,04524 in total
Arithmetic
Previous number1,998,044
Next number1,998,046
Double3,996,090
Half999,022.5
Square3,992,183,822,025
Cube7,976,562,924,677,941,125
Square root1,413.522196501≈irrational, shown to 9 decimal places
Cube root125.951039178≈
Negation-1,998,045
Reciprocal5.00489228 × 10^-7≈
Representations
Decimal1,998,045
Binary11110011111001101110121 bits
Octal7476335
Hexadecimal1E7CDD
Base 3616TP9
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, nine hundred and ninety-eight thousand and forty-five
Ordinalone million, nine hundred and ninety-eight thousand and forty-fifth
Scientific notation1.998045 × 10^6
Engineering notation1.998045 × 10^6
In other bases
Ternary10202111210200base 3; the most digit-efficient integer base after e: 14 digits
Quinary1002414140base 5; one hand: 10 digits
Septenary22661130base 7: 8 digits
Nonary3674720base 9; each digit is two ternary digits: 7 digits
Duodecimal804339base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalc9f25base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal9:15:0:45base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary11T10TTTT11T00digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11000111000110100101101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000111100111110011011101
Bit length21 bitsto write the magnitude
Set bits15the population count, or Hamming weight
Zero bits6within that length
Bit parityodd15 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 7c dd
Gray code100010100001010110011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000111100111110011011101
64-bit0000000000000000000000000000000000000000000111100111110011011101
One's complement11111111111000011000001100100010at 32 bits, every bit flipped
Bits reversed10111011001111100111100000000000at 32 bits
Rotated left by 100000000001111001111100110111010at 32 bits, wrapping
Shifted left by 11111001111100110111010= 3,996,090, no wrap
Shifted right by 111110011111001101110= 999,022, discarding the low bit
These bits as a double9.87165393 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,998,045 to the power 23,992,183,822,025
1,998,045 to the power 37,976,562,924,677,941,125
1,998,045 to the power 415,937,531,668,838,136,875,100,625
1,998,045 to the power 531,843,905,463,263,695,192,610,428,278,125
First ten multiples1,998,045, 3,996,090, 5,994,135, 7,992,180, 9,990,225, 11,988,270, 13,986,315, 15,984,360, 17,982,405, 19,980,450
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 1
Divisible by 5Yes
Divisible by 6No, remainder 3
Divisible by 7Yes
Divisible by 8No, remainder 5
Divisible by 9Yes
Divisible by 10No, remainder 5
Divisible by 11No, remainder 5
Divisible by 12No, remainder 9
Divisible by 100No, remainder 45
Collatz (3n + 1) trajectory
Steps to reach 1140the total stopping time
Highest value reached5,994,1363× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,998,045 → 5,994,136 → 2,997,068 → 1,498,534 → 749,267 → 2,247,802 → 1,123,901 → 3,371,704 → 1,685,852 → 842,926 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage199,804,500%
1,998,045% as a decimal19,980.45
1,998,045% of 1001,998,045
1,998,045% of 1,00019,980,450
As a fraction of 1001,998,045/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,045
Nerdulate something else
Nothing in mind? Surprise me · today’s page