Recognised as Number
6,042,989
- Positive
- Odd
- Prime
- 7 digits
6,042,989 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value6,042,989
Digit count7
Digit sum38
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation6,042,989
Distinct prime factors16,042,989
Number of divisors2
Sum of divisors σ(n)6,042,990
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)6,042,988integers below n that share no factor with it
Carmichael function λ(n)6,042,988the 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, 6,042,9892 in total
Arithmetic
Previous number6,042,988
Next number6,042,990
Double12,085,978
Half3,021,494.5
Square36,517,716,054,121
Cube220,676,156,420,176,607,669
Square root2,458.249173701≈irrational, shown to 9 decimal places
Cube root182.1450058≈
Negation-6,042,989
Reciprocal1.65481023 × 10^-7≈
Representations
Decimal6,042,989
Binary1011100001101010110110123 bits
Octal27032555
Hexadecimal5C356D
Base 363LIST
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordssix million, forty-two thousand, nine hundred and eighty-nine
Ordinalsix million, forty-two thousand, nine hundred and eighty-ninth
Scientific notation6.042989 × 10^6
Engineering notation6.042989 × 10^6
In other bases
Ternary102101000102102base 3; the most digit-efficient integer base after e: 15 digits
Quinary3021333424base 5; one hand: 10 digits
Septenary102236021base 7: 9 digits
Nonary12330372base 9; each digit is two ternary digits: 8 digits
Duodecimal2035125base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal1hf799base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal27:58:36:29base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary11T10100011T11Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101011000100101010111101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000010111000011010101101101
Bit length23 bitsto write the magnitude
Set bits13the population count, or Hamming weight
Zero bits10within that length
Bit parityodd13 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 22worth 4,194,304
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes35c 35 6d
Gray code11100100010111111011011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000010111000011010101101101
64-bit0000000000000000000000000000000000000000010111000011010101101101
One's complement11111111101000111100101010010010at 32 bits, every bit flipped
Bits reversed10110110101011000011101000000000at 32 bits
Rotated left by 100000000101110000110101011011010at 32 bits, wrapping
Shifted left by 1101110000110101011011010= 12,085,978, no wrap
Shifted right by 11011100001101010110110= 3,021,494, discarding the low bit
These bits as a double2.98563326 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
6,042,989 to the power 236,517,716,054,121
6,042,989 to the power 3220,676,156,420,176,607,669
6,042,989 to the power 41,333,543,585,809,406,618,201,082,641
6,042,989 to the power 58,058,589,220,066,800,290,316,342,187,653,949
First ten multiples6,042,989, 12,085,978, 18,128,967, 24,171,956, 30,214,945, 36,257,934, 42,300,923, 48,343,912, 54,386,901, 60,429,890
Powers of twoBetween 2^22 (4,194,304) and 2^23 (8,388,608)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 2
Divisible by 4No, remainder 1
Divisible by 5No, remainder 4
Divisible by 6No, remainder 5
Divisible by 7No, remainder 1
Divisible by 8No, remainder 5
Divisible by 9No, remainder 2
Divisible by 10No, remainder 9
Divisible by 11No, remainder 7
Divisible by 12No, remainder 5
Divisible by 100No, remainder 89
Collatz (3n + 1) trajectory
Steps to reach 1152the total stopping time
Highest value reached18,128,9683× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps6,042,989 → 18,128,968 → 9,064,484 → 4,532,242 → 2,266,121 → 6,798,364 → 3,399,182 → 1,699,591 → 5,098,774 → 2,549,387 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage604,298,900%
6,042,989% as a decimal60,429.89
6,042,989% of 1006,042,989
6,042,989% of 1,00060,429,890
As a fraction of 1006,042,989/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 6,042,989
Nerdulate something else
Nothing in mind? Surprise me · today’s page