Recognised as Number
3,089,773
- Positive
- Odd
- Composite
- 7 digits
3,089,773 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,089,773
Digit count7
Digit sum37
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation367 × 8,419
Distinct prime factors2367, 8,419
Number of divisors4
Sum of divisors σ(n)3,098,560
Aliquot sum8,787sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,080,988integers below n that share no factor with it
Carmichael function λ(n)8,418the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 3,080,988
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 367, 8,419, 3,089,7734 in total
Arithmetic
Previous number3,089,772
Next number3,089,774
Double6,179,546
Half1,544,886.5
Square9,546,697,191,529
Cube29,497,127,221,562,132,917
Square root1,757.775014045≈irrational, shown to 9 decimal places
Cube root145.649452997≈
Negation-3,089,773
Reciprocal3.23648372 × 10^-7≈
Representations
Decimal3,089,773
Binary101111001001010110110122 bits
Octal13622555
Hexadecimal2F256D
Base 361U831
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, eighty-nine thousand, seven hundred and seventy-three
Ordinalthree million, eighty-nine thousand, seven hundred and seventy-third
Scientific notation3.089773 × 10^6
Engineering notation3.089773 × 10^6
In other bases
Ternary12210222101001base 3; the most digit-efficient integer base after e: 14 digits
Quinary1242333043base 5; one hand: 10 digits
Septenary35156041base 7: 8 digits
Nonary5728331base 9; each digit is two ternary digits: 7 digits
Duodecimal1050091base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimalj648dbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal14:18:16:13base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0T1100T101001digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11100110111101010111101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001011110010010101101101
Bit length22 bitsto write the magnitude
Set bits13the population count, or Hamming weight
Zero bits9within that length
Bit parityodd13 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 21worth 2,097,152
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes32f 25 6d
Gray code1110001011011111011011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001011110010010101101101
64-bit0000000000000000000000000000000000000000001011110010010101101101
One's complement11111111110100001101101010010010at 32 bits, every bit flipped
Bits reversed10110110101001001111010000000000at 32 bits
Rotated left by 100000000010111100100101011011010at 32 bits, wrapping
Shifted left by 110111100100101011011010= 6,179,546, no wrap
Shifted right by 1101111001001010110110= 1,544,886, discarding the low bit
These bits as a double1.52655069 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,089,773 to the power 29,546,697,191,529
3,089,773 to the power 329,497,127,221,562,132,917
3,089,773 to the power 491,139,427,266,747,696,109,357,841
3,089,773 to the power 5281,600,141,604,260,829,250,898,904,460,093
First ten multiples3,089,773, 6,179,546, 9,269,319, 12,359,092, 15,448,865, 18,538,638, 21,628,411, 24,718,184, 27,807,957, 30,897,730
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 1
Divisible by 5No, remainder 3
Divisible by 6No, remainder 1
Divisible by 7No, remainder 1
Divisible by 8No, remainder 5
Divisible by 9No, remainder 1
Divisible by 10No, remainder 3
Divisible by 11No, remainder 5
Divisible by 12No, remainder 1
Divisible by 100No, remainder 73
Collatz (3n + 1) trajectory
Steps to reach 1102the total stopping time
Highest value reached9,269,3203× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,089,773 → 9,269,320 → 4,634,660 → 2,317,330 → 1,158,665 → 3,475,996 → 1,737,998 → 868,999 → 2,606,998 → 1,303,499 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage308,977,300%
3,089,773% as a decimal30,897.73
3,089,773% of 1003,089,773
3,089,773% of 1,00030,897,730
As a fraction of 1003,089,773/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 3,089,773
Nerdulate something else
Nothing in mind? Surprise me · today’s page