Recognised as Number
2,960,441
- Positive
- Odd
- Composite
- 7 digits
2,960,441 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 8.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value2,960,441
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 factorisation11 × 269,131
Distinct prime factors211, 269,131
Number of divisors4
Sum of divisors σ(n)3,229,584
Aliquot sum269,143sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,691,300integers below n that share no factor with it
Carmichael function λ(n)269,130the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,691,300
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 11, 269,131, 2,960,4414 in total
Arithmetic
Previous number2,960,440
Next number2,960,442
Double5,920,882
Half1,480,220.5
Square8,764,210,914,481
Cube25,945,929,323,877,046,121
Square root1,720.593211657≈irrational, shown to 9 decimal places
Cube root143.588217235≈
Negation-2,960,441
Reciprocal3.37787512 × 10^-7≈
Representations
Decimal2,960,441
Binary101101001011000011100122 bits
Octal13226071
Hexadecimal2D2C39
Base 361RGAH
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, nine hundred and sixty thousand, four hundred and forty-one
Ordinaltwo million, nine hundred and sixty thousand, four hundred and forty-first
Scientific notation2.960441 × 10^6
Engineering notation2.960441 × 10^6
In other bases
Ternary12120101221222base 3; the most digit-efficient integer base after e: 14 digits
Quinary1224213231base 5; one hand: 10 digits
Septenary34110011base 7: 8 digits
Nonary5511858base 9; each digit is two ternary digits: 7 digits
Duodecimalba9275base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalia121base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal13:42:20:41base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0TT011T00T00Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11111010111110001001001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001011010010110000111001
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
Bytes32d 2c 39
Gray code1110111011101000100101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001011010010110000111001
64-bit0000000000000000000000000000000000000000001011010010110000111001
One's complement11111111110100101101001111000110at 32 bits, every bit flipped
Bits reversed10011100001101001011010000000000at 32 bits
Rotated left by 100000000010110100101100001110010at 32 bits, wrapping
Shifted left by 110110100101100001110010= 5,920,882, no wrap
Shifted right by 1101101001011000011100= 1,480,220, discarding the low bit
These bits as a double1.46265219 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,960,441 to the power 28,764,210,914,481
2,960,441 to the power 325,945,929,323,877,046,121
2,960,441 to the power 476,811,392,953,507,886,295,499,361
2,960,441 to the power 5227,395,596,966,675,840,412,534,423,778,201
First ten multiples2,960,441, 5,920,882, 8,881,323, 11,841,764, 14,802,205, 17,762,646, 20,723,087, 23,683,528, 26,643,969, 29,604,410
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 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 1
Divisible by 8No, remainder 1
Divisible by 9No, remainder 8
Divisible by 10No, remainder 1
Divisible by 11Yes
Divisible by 12No, remainder 5
Divisible by 100No, remainder 41
Collatz (3n + 1) trajectory
Steps to reach 1120the total stopping time
Highest value reached16,004,4645× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,960,441 → 8,881,324 → 4,440,662 → 2,220,331 → 6,660,994 → 3,330,497 → 9,991,492 → 4,995,746 → 2,497,873 → 7,493,620 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage296,044,100%
2,960,441% as a decimal29,604.41
2,960,441% of 1002,960,441
2,960,441% of 1,00029,604,410
As a fraction of 1002,960,441/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,960,441
Nerdulate something else
Nothing in mind? Surprise me · today’s page