Recognised as Number
2,958,607
- Positive
- Odd
- Prime
- 7 digits
2,958,607 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value2,958,607
Digit count7
Digit sum37
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2,958,607
Distinct prime factors12,958,607
Number of divisors2
Sum of divisors σ(n)2,958,608
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,958,606integers below n that share no factor with it
Carmichael function λ(n)2,958,606the 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,958,6072 in total
Arithmetic
Previous number2,958,606
Next number2,958,608
Double5,917,214
Half1,479,303.5
Square8,753,355,380,449
Cube25,897,738,502,084,074,543
Square root1,720.060173366≈irrational, shown to 9 decimal places
Cube root143.558560033≈
Negation-2,958,607
Reciprocal3.37996902 × 10^-7≈
Representations
Decimal2,958,607
Binary101101001001010000111122 bits
Octal13222417
Hexadecimal2D250F
Base 361REVJ
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, nine hundred and fifty-eight thousand, six hundred and seven
Ordinaltwo million, nine hundred and fifty-eight thousand, six hundred and seventh
Scientific notation2.958607 × 10^6
Engineering notation2.958607 × 10^6
In other bases
Ternary12120022110001base 3; the most digit-efficient integer base after e: 14 digits
Quinary1224133412base 5; one hand: 10 digits
Septenary34101451base 7: 8 digits
Nonary5508401base 9; each digit is two ternary digits: 7 digits
Duodecimalba81a7base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimali9ga7base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal13:41:50:7base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0TT010T110001digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11111010110010100010011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001011010010010100001111
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 0f
Gray code1110111011011110001000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001011010010010100001111
64-bit0000000000000000000000000000000000000000001011010010010100001111
One's complement11111111110100101101101011110000at 32 bits, every bit flipped
Bits reversed11110000101001001011010000000000at 32 bits
Rotated left by 100000000010110100100101000011110at 32 bits, wrapping
Shifted left by 110110100100101000011110= 5,917,214, no wrap
Shifted right by 1101101001001010000111= 1,479,303, discarding the low bit
These bits as a double1.46174608 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,958,607 to the power 28,753,355,380,449
2,958,607 to the power 325,897,738,502,084,074,543
2,958,607 to the power 476,621,230,416,435,457,531,441,601
2,958,607 to the power 5226,692,108,658,678,859,700,725,840,809,807
First ten multiples2,958,607, 5,917,214, 8,875,821, 11,834,428, 14,793,035, 17,751,642, 20,710,249, 23,668,856, 26,627,463, 29,586,070
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 1
Divisible by 8No, remainder 7
Divisible by 9No, remainder 1
Divisible by 10No, remainder 7
Divisible by 11No, remainder 3
Divisible by 12No, remainder 7
Divisible by 100No, remainder 7
Collatz (3n + 1) trajectory
Steps to reach 1182the total stopping time
Highest value reached29,955,90410× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,958,607 → 8,875,822 → 4,437,911 → 13,313,734 → 6,656,867 → 19,970,602 → 9,985,301 → 29,955,904 → 14,977,952 → 7,488,976 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage295,860,700%
2,958,607% as a decimal29,586.07
2,958,607% of 1002,958,607
2,958,607% of 1,00029,586,070
As a fraction of 1002,958,607/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,607
Nerdulate something else
Nothing in mind? Surprise me · today’s page