Recognised as Number
1,998,429
- Positive
- Odd
- Composite
- 7 digits
1,998,429 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 6.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,998,429
Digit count7
Digit sum42
Digit product46,656
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root6repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3 × 666,143
Distinct prime factors23, 666,143
Number of divisors4
Sum of divisors σ(n)2,664,576
Aliquot sum666,147sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,332,284integers below n that share no factor with it
Carmichael function λ(n)666,142the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,332,284
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 3, 666,143, 1,998,4294 in total
Arithmetic
Previous number1,998,428
Next number1,998,430
Double3,996,858
Half999,214.5
Square3,993,718,468,041
Cube7,981,162,804,368,707,589
Square root1,413.658020881≈irrational, shown to 9 decimal places
Cube root125.959107415≈
Negation-1,998,429
Reciprocal5.00393059 × 10^-7≈
Representations
Decimal1,998,429
Binary11110011111100101110121 bits
Octal7477135
Hexadecimal1E7E5D
Base 3616TZX
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, nine hundred and ninety-eight thousand, four hundred and twenty-nine
Ordinalone million, nine hundred and ninety-eight thousand, four hundred and twenty-ninth
Scientific notation1.998429 × 10^6
Engineering notation1.998429 × 10^6
In other bases
Ternary10202112022220base 3; the most digit-efficient integer base after e: 14 digits
Quinary1002422204base 5; one hand: 10 digits
Septenary22662216base 7: 8 digits
Nonary3675286base 9; each digit is two ternary digits: 7 digits
Duodecimal8045b9base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalc9g19base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal9:15:7:9base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary11T10TTT1000T0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11000111000001110101101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000111100111111001011101
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 7e 5d
Gray code100010100000101110011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000111100111111001011101
64-bit0000000000000000000000000000000000000000000111100111111001011101
One's complement11111111111000011000000110100010at 32 bits, every bit flipped
Bits reversed10111010011111100111100000000000at 32 bits
Rotated left by 100000000001111001111110010111010at 32 bits, wrapping
Shifted left by 11111001111110010111010= 3,996,858, no wrap
Shifted right by 111110011111100101110= 999,214, discarding the low bit
These bits as a double9.87355115 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,998,429 to the power 23,993,718,468,041
1,998,429 to the power 37,981,162,804,368,707,589
1,998,429 to the power 415,949,787,201,971,751,938,377,681
1,998,429 to the power 531,874,517,288,249,206,254,460,170,663,149
First ten multiples1,998,429, 3,996,858, 5,995,287, 7,993,716, 9,992,145, 11,990,574, 13,989,003, 15,987,432, 17,985,861, 19,984,290
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 5No, remainder 4
Divisible by 6No, remainder 3
Divisible by 7No, remainder 6
Divisible by 8No, remainder 5
Divisible by 9No, remainder 6
Divisible by 10No, remainder 9
Divisible by 11No, remainder 4
Divisible by 12No, remainder 9
Divisible by 100No, remainder 29
Collatz (3n + 1) trajectory
Steps to reach 1153the total stopping time
Highest value reached5,995,2883× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,998,429 → 5,995,288 → 2,997,644 → 1,498,822 → 749,411 → 2,248,234 → 1,124,117 → 3,372,352 → 1,686,176 → 843,088 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage199,842,900%
1,998,429% as a decimal19,984.29
1,998,429% of 1001,998,429
1,998,429% of 1,00019,984,290
As a fraction of 1001,998,429/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,429
Nerdulate something else
Nothing in mind? Surprise me · today’s page