Recognised as Number
2,958,667
- Positive
- Odd
- Composite
- 7 digits
2,958,667 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value2,958,667
Digit count7
Digit sum43
Digit product181,440
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation29 × 102,023
Distinct prime factors229, 102,023
Number of divisors4
Sum of divisors σ(n)3,060,720
Aliquot sum102,053sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,856,616integers below n that share no factor with it
Carmichael function λ(n)1,428,308the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,856,616
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 29, 102,023, 2,958,6674 in total
Arithmetic
Previous number2,958,666
Next number2,958,668
Double5,917,334
Half1,479,333.5
Square8,753,710,416,889
Cube25,899,314,138,005,726,963
Square root1,720.077614528≈irrational, shown to 9 decimal places
Cube root143.559530473≈
Negation-2,958,667
Reciprocal3.37990048 × 10^-7≈
Representations
Decimal2,958,667
Binary101101001001010100101122 bits
Octal13222513
Hexadecimal2D254B
Base 361REX7
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, nine hundred and fifty-eight thousand, six hundred and sixty-seven
Ordinaltwo million, nine hundred and fifty-eight thousand, six hundred and sixty-seventh
Scientific notation2.958667 × 10^6
Engineering notation2.958667 × 10^6
In other bases
Ternary12120022112021base 3; the most digit-efficient integer base after e: 14 digits
Quinary1224134132base 5; one hand: 10 digits
Septenary34101565base 7: 8 digits
Nonary5508467base 9; each digit is two ternary digits: 7 digits
Duodecimalba8237base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimali9gd7base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal13:41:51:7base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0TT0100TTT1T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11111010110010101011111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001011010010010101001011
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 25 4b
Gray code1110111011011111101110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001011010010010101001011
64-bit0000000000000000000000000000000000000000001011010010010101001011
One's complement11111111110100101101101010110100at 32 bits, every bit flipped
Bits reversed11010010101001001011010000000000at 32 bits
Rotated left by 100000000010110100100101010010110at 32 bits, wrapping
Shifted left by 110110100100101010010110= 5,917,334, no wrap
Shifted right by 1101101001001010100101= 1,479,333, discarding the low bit
These bits as a double1.46177572 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,958,667 to the power 28,753,710,416,889
2,958,667 to the power 325,899,314,138,005,726,963
2,958,667 to the power 476,627,446,062,750,990,176,438,321
2,958,667 to the power 5226,715,095,960,141,283,852,352,237,878,107
First ten multiples2,958,667, 5,917,334, 8,876,001, 11,834,668, 14,793,335, 17,752,002, 20,710,669, 23,669,336, 26,628,003, 29,586,670
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 2
Divisible by 6No, remainder 1
Divisible by 7No, remainder 5
Divisible by 8No, remainder 3
Divisible by 9No, remainder 7
Divisible by 10No, remainder 7
Divisible by 11No, remainder 8
Divisible by 12No, remainder 7
Divisible by 100No, remainder 67
Collatz (3n + 1) trajectory
Steps to reach 1288the total stopping time
Highest value reached13,314,0044× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,958,667 → 8,876,002 → 4,438,001 → 13,314,004 → 6,657,002 → 3,328,501 → 9,985,504 → 4,992,752 → 2,496,376 → 1,248,188 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage295,866,700%
2,958,667% as a decimal29,586.67
2,958,667% of 1002,958,667
2,958,667% of 1,00029,586,670
As a fraction of 1002,958,667/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,958,667
Nerdulate something else
Nothing in mind? Surprise me · today’s page