Recognised as Number
1,988,573
- Positive
- Odd
- Composite
- 7 digits
1,988,573 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 5.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,988,573
Digit count7
Digit sum41
Digit product60,480
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation397 × 5,009
Distinct prime factors2397, 5,009
Number of divisors4
Sum of divisors σ(n)1,993,980
Aliquot sum5,407sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,983,168integers below n that share no factor with it
Carmichael function λ(n)495,792the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,983,168
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 397, 5,009, 1,988,5734 in total
Arithmetic
Previous number1,988,572
Next number1,988,574
Double3,977,146
Half994,286.5
Square3,954,422,576,329
Cube7,863,657,965,878,288,517
Square root1,410.167720521≈irrational, shown to 9 decimal places
Cube root125.751694581≈
Negation-1,988,573
Reciprocal5.02873166 × 10^-7≈
Representations
Decimal1,988,573
Binary11110010101111101110121 bits
Octal7453735
Hexadecimal1E57DD
Base 3616ME5
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, nine hundred and eighty-eight thousand, five hundred and seventy-three
Ordinalone million, nine hundred and eighty-eight thousand, five hundred and seventy-third
Scientific notation1.988573 × 10^6
Engineering notation1.988573 × 10^6
In other bases
Ternary10202000210212base 3; the most digit-efficient integer base after e: 14 digits
Quinary1002113243base 5; one hand: 10 digits
Septenary22621406base 7: 8 digits
Nonary3660725base 9; each digit is two ternary digits: 7 digits
Duodecimal7ba965base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalc8b8dbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal9:12:22:53base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary11T1T001T110TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11000111010100000101101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000111100101011111011101
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 57 dd
Gray code100010111110000110011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000111100101011111011101
64-bit0000000000000000000000000000000000000000000111100101011111011101
One's complement11111111111000011010100000100010at 32 bits, every bit flipped
Bits reversed10111011111010100111100000000000at 32 bits
Rotated left by 100000000001111001010111110111010at 32 bits, wrapping
Shifted left by 11111001010111110111010= 3,977,146, no wrap
Shifted right by 111110010101111101110= 994,286, discarding the low bit
These bits as a double9.82485604 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,988,573 to the power 23,954,422,576,329
1,988,573 to the power 37,863,657,965,878,288,517
1,988,573 to the power 415,637,457,912,180,485,831,116,241
1,988,573 to the power 531,096,226,592,798,485,250,640,316,714,093
First ten multiples1,988,573, 3,977,146, 5,965,719, 7,954,292, 9,942,865, 11,931,438, 13,920,011, 15,908,584, 17,897,157, 19,885,730
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 3
Divisible by 6No, remainder 5
Divisible by 7No, remainder 6
Divisible by 8No, remainder 5
Divisible by 9No, remainder 5
Divisible by 10No, remainder 3
Divisible by 11No, remainder 4
Divisible by 12No, remainder 5
Divisible by 100No, remainder 73
Collatz (3n + 1) trajectory
Steps to reach 1215the total stopping time
Highest value reached5,965,7203× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,988,573 → 5,965,720 → 2,982,860 → 1,491,430 → 745,715 → 2,237,146 → 1,118,573 → 3,355,720 → 1,677,860 → 838,930 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage198,857,300%
1,988,573% as a decimal19,885.73
1,988,573% of 1001,988,573
1,988,573% of 1,00019,885,730
As a fraction of 1001,988,573/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,988,573
Nerdulate something else
Nothing in mind? Surprise me · today’s page