Recognised as Number
2,655,071
- Positive
- Odd
- Prime
- 7 digits
2,655,071 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 8.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value2,655,071
Digit count7
Digit sum26
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2,655,071
Distinct prime factors12,655,071
Number of divisors2
Sum of divisors σ(n)2,655,072
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,655,070integers below n that share no factor with it
Carmichael function λ(n)2,655,070the 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, 2,655,0712 in total
Arithmetic
Previous number2,655,070
Next number2,655,072
Double5,310,142
Half1,327,535.5
Square7,049,402,015,041
Cube18,716,662,857,476,922,911
Square root1,629.438860467≈irrational, shown to 9 decimal places
Cube root138.470963168≈
Negation-2,655,071
Reciprocal3.76637762 × 10^-7≈
Representations
Decimal2,655,071
Binary101000100000110101111122 bits
Octal12101537
Hexadecimal28835F
Base 361KWNZ
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, six hundred and fifty-five thousand and seventy-one
Ordinaltwo million, six hundred and fifty-five thousand and seventy-first
Scientific notation2.655071 × 10^6
Engineering notation2.655071 × 10^6
In other bases
Ternary11222220001222base 3; the most digit-efficient integer base after e: 14 digits
Quinary1134430241base 5; one hand: 10 digits
Septenary31365506base 7: 8 digits
Nonary4886058base 9; each digit is two ternary digits: 7 digits
Duodecimala805bbbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalgbhdbbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal12:17:31:11base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1TT0000T001T00Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11110011000010010100011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001010001000001101011111
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
Bytes328 83 5f
Gray code1111001100001011110000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001010001000001101011111
64-bit0000000000000000000000000000000000000000001010001000001101011111
One's complement11111111110101110111110010100000at 32 bits, every bit flipped
Bits reversed11111010110000010001010000000000at 32 bits
Rotated left by 100000000010100010000011010111110at 32 bits, wrapping
Shifted left by 110100010000011010111110= 5,310,142, no wrap
Shifted right by 1101000100000110101111= 1,327,535, discarding the low bit
These bits as a double1.31177937 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,655,071 to the power 27,049,402,015,041
2,655,071 to the power 318,716,662,857,476,922,911
2,655,071 to the power 449,694,068,769,664,111,190,231,681
2,655,071 to the power 5131,941,280,862,340,861,361,959,619,504,351
First ten multiples2,655,071, 5,310,142, 7,965,213, 10,620,284, 13,275,355, 15,930,426, 18,585,497, 21,240,568, 23,895,639, 26,550,710
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 2
Divisible by 4No, remainder 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 6
Divisible by 8No, remainder 7
Divisible by 9No, remainder 8
Divisible by 10No, remainder 1
Divisible by 11No, remainder 1
Divisible by 12No, remainder 11
Divisible by 100No, remainder 71
Collatz (3n + 1) trajectory
Steps to reach 194the total stopping time
Highest value reached40,323,90415× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,655,071 → 7,965,214 → 3,982,607 → 11,947,822 → 5,973,911 → 17,921,734 → 8,960,867 → 26,882,602 → 13,441,301 → 40,323,904 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage265,507,100%
2,655,071% as a decimal26,550.71
2,655,071% of 1002,655,071
2,655,071% of 1,00026,550,710
As a fraction of 1002,655,071/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,071
Nerdulate something else
Nothing in mind? Surprise me · today’s page