Recognised as Number
2,642,961
- Positive
- Odd
- Composite
- 7 digits
2,642,961 is an odd 7-digit integer and a composite number. It has 8 divisors and a digital root of 3.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value2,642,961
Digit count7
Digit sum30
Digit product5,184
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root3repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3 × 227 × 3,881
Distinct prime factors33, 227, 3,881
Number of divisors8
Sum of divisors σ(n)3,540,384
Aliquot sum897,423sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,753,760integers below n that share no factor with it
Carmichael function λ(n)438,440the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,753,760
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 3, 227, 681, 3,881, 11,643, 880,987, 2,642,9618 in total
Arithmetic
Previous number2,642,960
Next number2,642,962
Double5,285,922
Half1,321,480.5
Square6,985,242,847,521
Cube18,461,724,421,526,949,681
Square root1,625.718610338≈irrational, shown to 9 decimal places
Cube root138.260116413≈
Negation-2,642,961
Reciprocal3.7836351 × 10^-7≈
Representations
Decimal2,642,961
Binary101000010101000001000122 bits
Octal12052021
Hexadecimal285411
Base 361KNBL
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, six hundred and forty-two thousand, nine hundred and sixty-one
Ordinaltwo million, six hundred and forty-two thousand, nine hundred and sixty-first
Scientific notation2.642961 × 10^6
Engineering notation2.642961 × 10^6
In other bases
Ternary11222021110110base 3; the most digit-efficient integer base after e: 14 digits
Quinary1134033321base 5; one hand: 10 digits
Septenary31315266base 7: 8 digits
Nonary4867413base 9; each digit is two ternary digits: 7 digits
Duodecimala755a9base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalga781base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal12:14:9:21base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1TT00T1T1110110digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11110000101010000010001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001010000101010000010001
Bit length22 bitsto write the magnitude
Set bits7the population count, or Hamming weight
Zero bits15within that length
Bit parityodd7 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 54 11
Gray code1111000111111000011001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001010000101010000010001
64-bit0000000000000000000000000000000000000000001010000101010000010001
One's complement11111111110101111010101111101110at 32 bits, every bit flipped
Bits reversed10001000001010100001010000000000at 32 bits
Rotated left by 100000000010100001010100000100010at 32 bits, wrapping
Shifted left by 110100001010100000100010= 5,285,922, no wrap
Shifted right by 1101000010101000001000= 1,321,480, discarding the low bit
These bits as a double1.30579623 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,642,961 to the power 26,985,242,847,521
2,642,961 to the power 318,461,724,421,526,949,681
2,642,961 to the power 448,793,617,638,843,288,455,845,441
2,642,961 to the power 5128,959,628,468,374,896,500,549,722,590,801
First ten multiples2,642,961, 5,285,922, 7,928,883, 10,571,844, 13,214,805, 15,857,766, 18,500,727, 21,143,688, 23,786,649, 26,429,610
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 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 3
Divisible by 7No, remainder 6
Divisible by 8No, remainder 1
Divisible by 9No, remainder 3
Divisible by 10No, remainder 1
Divisible by 11No, remainder 2
Divisible by 12No, remainder 9
Divisible by 100No, remainder 61
Collatz (3n + 1) trajectory
Steps to reach 1187the total stopping time
Highest value reached7,928,8843× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,642,961 → 7,928,884 → 3,964,442 → 1,982,221 → 5,946,664 → 2,973,332 → 1,486,666 → 743,333 → 2,230,000 → 1,115,000 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage264,296,100%
2,642,961% as a decimal26,429.61
2,642,961% of 1002,642,961
2,642,961% of 1,00026,429,610
As a fraction of 1002,642,961/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,642,961
Nerdulate something else
Nothing in mind? Surprise me · today’s page