Recognised as Number
2,773,563
- Positive
- Odd
- Composite
- 7 digits
2,773,563 is an odd 7-digit integer and a composite number. It has 24 divisors and a digital root of 6.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value2,773,563
Digit count7
Digit sum33
Digit product26,460
Multiplicative persistence2times 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 × 13 × 19^2 × 197
Distinct prime factors43, 13, 19, 197
Number of divisors24
Sum of divisors σ(n)4,224,528
Aliquot sum1,450,965sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,608,768integers below n that share no factor with it
Carmichael function λ(n)33,516the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,608,768
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 3, 13, 19, 39, 57, 197, 247, 361, 591, 741, 1,083, 2,561, 3,743, 4,693, 7,683, 11,229, 14,079, 48,659, 71,117, 145,977, 213,351, 924,521, 2,773,56324 in total
Arithmetic
Previous number2,773,562
Next number2,773,564
Double5,547,126
Half1,386,781.5
Square7,692,651,714,969
Cube21,336,054,168,524,564,547
Square root1,665.401753332≈irrational, shown to 9 decimal places
Cube root140.500977269≈
Negation-2,773,563
Reciprocal3.60547065 × 10^-7≈
Representations
Decimal2,773,563
Binary101010010100100011101122 bits
Octal12451073
Hexadecimal2A523B
Base 361NG3F
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, seven hundred and seventy-three thousand, five hundred and sixty-three
Ordinaltwo million, seven hundred and seventy-three thousand, five hundred and sixty-third
Scientific notation2.773563 × 10^6
Engineering notation2.773563 × 10^6
In other bases
Ternary12012220121120base 3; the most digit-efficient integer base after e: 14 digits
Quinary1202223223base 5; one hand: 10 digits
Septenary32401122base 7: 8 digits
Nonary5186546base 9; each digit is two ternary digits: 7 digits
Duodecimalb190a3base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalh6di3base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal12:50:26:3base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1TT1T00T1T0TTT0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11111100101011001001111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001010100101001000111011
Bit length22 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits11within that length
Bit parityodd11 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
Bytes32a 52 3b
Gray code1111110111101100100110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001010100101001000111011
64-bit0000000000000000000000000000000000000000001010100101001000111011
One's complement11111111110101011010110111000100at 32 bits, every bit flipped
Bits reversed11011100010010100101010000000000at 32 bits
Rotated left by 100000000010101001010010001110110at 32 bits, wrapping
Shifted left by 110101001010010001110110= 5,547,126, no wrap
Shifted right by 1101010010100100011101= 1,386,781, discarding the low bit
These bits as a double1.37032219 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,773,563 to the power 27,692,651,714,969
2,773,563 to the power 321,336,054,168,524,564,547
2,773,563 to the power 459,176,890,407,815,496,818,670,961
2,773,563 to the power 5164,130,833,690,171,972,802,883,486,604,043
First ten multiples2,773,563, 5,547,126, 8,320,689, 11,094,252, 13,867,815, 16,641,378, 19,414,941, 22,188,504, 24,962,067, 27,735,630
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 3
Divisible by 5No, remainder 3
Divisible by 6No, remainder 3
Divisible by 7No, remainder 2
Divisible by 8No, remainder 3
Divisible by 9No, remainder 6
Divisible by 10No, remainder 3
Divisible by 11No, remainder 1
Divisible by 12No, remainder 3
Divisible by 100No, remainder 63
Collatz (3n + 1) trajectory
Steps to reach 1107the total stopping time
Highest value reached14,041,1685× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,773,563 → 8,320,690 → 4,160,345 → 12,481,036 → 6,240,518 → 3,120,259 → 9,360,778 → 4,680,389 → 14,041,168 → 7,020,584 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage277,356,300%
2,773,563% as a decimal27,735.63
2,773,563% of 1002,773,563
2,773,563% of 1,00027,735,630
As a fraction of 1002,773,563/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 2,773,563
Nerdulate something else
Nothing in mind? Surprise me · today’s page