Recognised as Number
2,921,179
- Positive
- Odd
- Prime
- 7 digits
2,921,179 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value2,921,179
Digit count7
Digit sum31
Digit product2,268
Multiplicative persistence4times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2,921,179
Distinct prime factors12,921,179
Number of divisors2
Sum of divisors σ(n)2,921,180
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,921,178integers below n that share no factor with it
Carmichael function λ(n)2,921,178the 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,921,1792 in total
Arithmetic
Previous number2,921,178
Next number2,921,180
Double5,842,358
Half1,460,589.5
Square8,533,286,750,041
Cube24,927,258,055,198,018,339
Square root1,709.145693029≈irrational, shown to 9 decimal places
Cube root142.950624387≈
Negation-2,921,179
Reciprocal3.42327533 × 10^-7≈
Representations
Decimal2,921,179
Binary101100100100101101101122 bits
Octal13111333
Hexadecimal2C92DB
Base 361QLZV
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, nine hundred and twenty-one thousand, one hundred and seventy-nine
Ordinaltwo million, nine hundred and twenty-one thousand, one hundred and seventy-ninth
Scientific notation2.921179 × 10^6
Engineering notation2.921179 × 10^6
In other bases
Ternary12111102002211base 3; the most digit-efficient integer base after e: 14 digits
Quinary1221434204base 5; one hand: 10 digits
Septenary33554362base 7: 8 digits
Nonary5442084base 9; each digit is two ternary digits: 7 digits
Duodecimalb8a5b7base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimali52ijbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal13:31:26:19base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1TT11111T010T11digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11111011001011100101111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001011001001001011011011
Bit length22 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits10within that length
Bit parityeven12 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
Bytes32c 92 db
Gray code1110101101101110110110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001011001001001011011011
64-bit0000000000000000000000000000000000000000001011001001001011011011
One's complement11111111110100110110110100100100at 32 bits, every bit flipped
Bits reversed11011011010010010011010000000000at 32 bits
Rotated left by 100000000010110010010010110110110at 32 bits, wrapping
Shifted left by 110110010010010110110110= 5,842,358, no wrap
Shifted right by 1101100100100101101101= 1,460,589, discarding the low bit
These bits as a double1.44325419 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,921,179 to the power 28,533,286,750,041
2,921,179 to the power 324,927,258,055,198,018,339
2,921,179 to the power 472,816,982,758,425,292,013,501,681
2,921,179 to the power 5212,711,440,877,274,036,098,708,827,001,899
First ten multiples2,921,179, 5,842,358, 8,763,537, 11,684,716, 14,605,895, 17,527,074, 20,448,253, 23,369,432, 26,290,611, 29,211,790
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 3
Divisible by 5No, remainder 4
Divisible by 6No, remainder 1
Divisible by 7No, remainder 2
Divisible by 8No, remainder 3
Divisible by 9No, remainder 4
Divisible by 10No, remainder 9
Divisible by 11No, remainder 8
Divisible by 12No, remainder 7
Divisible by 100No, remainder 79
Collatz (3n + 1) trajectory
Steps to reach 1200the total stopping time
Highest value reached359,765,872123× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,921,179 → 8,763,538 → 4,381,769 → 13,145,308 → 6,572,654 → 3,286,327 → 9,858,982 → 4,929,491 → 14,788,474 → 7,394,237 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage292,117,900%
2,921,179% as a decimal29,211.79
2,921,179% of 1002,921,179
2,921,179% of 1,00029,211,790
As a fraction of 1002,921,179/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,921,179
Nerdulate something else
Nothing in mind? Surprise me · today’s page