Recognised as Number
1,998,761
- Positive
- Odd
- Prime
- 7 digits
1,998,761 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,761
Digit count7
Digit sum41
Digit product27,216
Multiplicative persistence5times 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 factorisation1,998,761
Distinct prime factors11,998,761
Number of divisors2
Sum of divisors σ(n)1,998,762
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,998,760integers below n that share no factor with it
Carmichael function λ(n)1,998,760the 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,7612 in total
Arithmetic
Previous number1,998,760
Next number1,998,762
Double3,997,522
Half999,380.5
Square3,995,045,535,121
Cube7,985,141,208,823,985,081
Square root1,413.775441858≈irrational, shown to 9 decimal places
Cube root125.966082245≈
Negation-1,998,761
Reciprocal5.00309942 × 10^-7≈
Representations
Decimal1,998,761
Binary11110011111111010100121 bits
Octal7477651
Hexadecimal1E7FA9
Base 3616U95
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, nine hundred and ninety-eight thousand, seven hundred and sixty-one
Ordinalone million, nine hundred and ninety-eight thousand, seven hundred and sixty-first
Scientific notation1.998761 × 10^6
Engineering notation1.998761 × 10^6
In other bases
Ternary10202112210012base 3; the most digit-efficient integer base after e: 14 digits
Quinary1002430021base 5; one hand: 10 digits
Septenary22663202base 7: 8 digits
Nonary3675705base 9; each digit is two ternary digits: 7 digits
Duodecimal804835base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalc9gi1base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal9:15:12:41base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary11T10TT0T101TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11000111000000011111001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000111100111111110101001
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 7f a9
Gray code100010100000001111101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000111100111111110101001
64-bit0000000000000000000000000000000000000000000111100111111110101001
One's complement11111111111000011000000001010110at 32 bits, every bit flipped
Bits reversed10010101111111100111100000000000at 32 bits
Rotated left by 100000000001111001111111101010010at 32 bits, wrapping
Shifted left by 11111001111111101010010= 3,997,522, no wrap
Shifted right by 111110011111111010100= 999,380, discarding the low bit
These bits as a double9.87519144 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,998,761 to the power 23,995,045,535,121
1,998,761 to the power 37,985,141,208,823,985,081
1,998,761 to the power 415,960,388,827,690,237,244,484,641
1,998,761 to the power 531,901,002,733,622,966,285,023,365,529,801
First ten multiples1,998,761, 3,997,522, 5,996,283, 7,995,044, 9,993,805, 11,992,566, 13,991,327, 15,990,088, 17,988,849, 19,987,610
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 2
Divisible by 8No, remainder 1
Divisible by 9No, remainder 5
Divisible by 10No, remainder 1
Divisible by 11No, remainder 6
Divisible by 12No, remainder 5
Divisible by 100No, remainder 61
Collatz (3n + 1) trajectory
Steps to reach 1215the total stopping time
Highest value reached48,624,78424× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,998,761 → 5,996,284 → 2,998,142 → 1,499,071 → 4,497,214 → 2,248,607 → 6,745,822 → 3,372,911 → 10,118,734 → 5,059,367 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage199,876,100%
1,998,761% as a decimal19,987.61
1,998,761% of 1001,998,761
1,998,761% of 1,00019,987,610
As a fraction of 1001,998,761/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,761
Nerdulate something else
Nothing in mind? Surprise me · today’s page