Recognised as Number
2,655,073
- Positive
- Odd
- Composite
- 7 digits
2,655,073 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 value2,655,073
Digit count7
Digit sum28
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 factorisation1,013 × 2,621
Distinct prime factors21,013, 2,621
Number of divisors4
Sum of divisors σ(n)2,658,708
Aliquot sum3,635sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,651,440integers below n that share no factor with it
Carmichael function λ(n)662,860the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,651,440
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 1,013, 2,621, 2,655,0734 in total
Arithmetic
Previous number2,655,072
Next number2,655,074
Double5,310,146
Half1,327,536.5
Square7,049,412,635,329
Cube18,716,705,153,920,874,017
Square root1,629.439474175≈irrational, shown to 9 decimal places
Cube root138.470997937≈
Negation-2,655,073
Reciprocal3.76637479 × 10^-7≈
Representations
Decimal2,655,073
Binary101000100000110110000122 bits
Octal12101541
Hexadecimal288361
Base 361KWO1
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, six hundred and fifty-five thousand and seventy-three
Ordinaltwo million, six hundred and fifty-five thousand and seventy-third
Scientific notation2.655073 × 10^6
Engineering notation2.655073 × 10^6
In other bases
Ternary11222220002001base 3; the most digit-efficient integer base after e: 14 digits
Quinary1134430243base 5; one hand: 10 digits
Septenary31365511base 7: 8 digits
Nonary4886061base 9; each digit is two ternary digits: 7 digits
Duodecimala80601base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalgbhddbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal12:17:31:13base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1TT0000T001T001digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11110011000010010100001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001010001000001101100001
Bit length22 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits14within that length
Bit parityeven8 set bits, so even; 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
Bytes328 83 61
Gray code1111001100001011010001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001010001000001101100001
64-bit0000000000000000000000000000000000000000001010001000001101100001
One's complement11111111110101110111110010011110at 32 bits, every bit flipped
Bits reversed10000110110000010001010000000000at 32 bits
Rotated left by 100000000010100010000011011000010at 32 bits, wrapping
Shifted left by 110100010000011011000010= 5,310,146, no wrap
Shifted right by 1101000100000110110000= 1,327,536, discarding the low bit
These bits as a double1.31178036 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,655,073 to the power 27,049,412,635,329
2,655,073 to the power 318,716,705,153,920,874,017
2,655,073 to the power 449,694,218,503,136,156,738,938,241
2,655,073 to the power 5131,941,777,803,777,225,081,322,972,346,593
First ten multiples2,655,073, 5,310,146, 7,965,219, 10,620,292, 13,275,365, 15,930,438, 18,585,511, 21,240,584, 23,895,657, 26,550,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 1
Divisible by 9No, remainder 1
Divisible by 10No, remainder 3
Divisible by 11No, remainder 3
Divisible by 12No, remainder 1
Divisible by 100No, remainder 73
Collatz (3n + 1) trajectory
Steps to reach 1187the total stopping time
Highest value reached17,011,6726× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,655,073 → 7,965,220 → 3,982,610 → 1,991,305 → 5,973,916 → 2,986,958 → 1,493,479 → 4,480,438 → 2,240,219 → 6,720,658 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage265,507,300%
2,655,073% as a decimal26,550.73
2,655,073% of 1002,655,073
2,655,073% of 1,00026,550,730
As a fraction of 1002,655,073/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,655,073
Nerdulate something else
Nothing in mind? Surprise me · today’s page