Recognised as Number
2,961,209
- Positive
- Odd
- Prime
- 7 digits
2,961,209 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value2,961,209
Digit count7
Digit sum29
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2,961,209
Distinct prime factors12,961,209
Number of divisors2
Sum of divisors σ(n)2,961,210
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,961,208integers below n that share no factor with it
Carmichael function λ(n)2,961,208the 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,961,2092 in total
Arithmetic
Previous number2,961,208
Next number2,961,210
Double5,922,418
Half1,480,604.5
Square8,768,758,741,681
Cube25,966,127,304,694,452,329
Square root1,720.816376026≈irrational, shown to 9 decimal places
Cube root143.600632751≈
Negation-2,961,209
Reciprocal3.37699906 × 10^-7≈
Representations
Decimal2,961,209
Binary101101001011110011100122 bits
Octal13227471
Hexadecimal2D2F39
Base 361RGVT
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, nine hundred and sixty-one thousand, two hundred and nine
Ordinaltwo million, nine hundred and sixty-one thousand, two hundred and ninth
Scientific notation2.961209 × 10^6
Engineering notation2.961209 × 10^6
In other bases
Ternary12120110000102base 3; the most digit-efficient integer base after e: 14 digits
Quinary1224224314base 5; one hand: 10 digits
Septenary34112156base 7: 8 digits
Nonary5513012base 9; each digit is two ternary digits: 7 digits
Duodecimalba97b5base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalia309base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal13:42:33:29base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0TT011000011Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11111010111001101001001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001011010010111100111001
Bit length22 bitsto write the magnitude
Set bits13the population count, or Hamming weight
Zero bits9within that length
Bit parityodd13 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 2f 39
Gray code1110111011100010100101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001011010010111100111001
64-bit0000000000000000000000000000000000000000001011010010111100111001
One's complement11111111110100101101000011000110at 32 bits, every bit flipped
Bits reversed10011100111101001011010000000000at 32 bits
Rotated left by 100000000010110100101111001110010at 32 bits, wrapping
Shifted left by 110110100101111001110010= 5,922,418, no wrap
Shifted right by 1101101001011110011100= 1,480,604, discarding the low bit
These bits as a double1.46303164 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,961,209 to the power 28,768,758,741,681
2,961,209 to the power 325,966,127,304,694,452,329
2,961,209 to the power 476,891,129,869,806,954,486,705,761
2,961,209 to the power 5227,690,705,790,641,181,888,623,479,825,049
First ten multiples2,961,209, 5,922,418, 8,883,627, 11,844,836, 14,806,045, 17,767,254, 20,728,463, 23,689,672, 26,650,881, 29,612,090
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 4
Divisible by 6No, remainder 5
Divisible by 7No, remainder 6
Divisible by 8No, remainder 1
Divisible by 9No, remainder 2
Divisible by 10No, remainder 9
Divisible by 11No, remainder 9
Divisible by 12No, remainder 5
Divisible by 100No, remainder 9
Collatz (3n + 1) trajectory
Steps to reach 1169the total stopping time
Highest value reached9,994,0843× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,961,209 → 8,883,628 → 4,441,814 → 2,220,907 → 6,662,722 → 3,331,361 → 9,994,084 → 4,997,042 → 2,498,521 → 7,495,564 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage296,120,900%
2,961,209% as a decimal29,612.09
2,961,209% of 1002,961,209
2,961,209% of 1,00029,612,090
As a fraction of 1002,961,209/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,961,209
Nerdulate something else
Nothing in mind? Surprise me · today’s page