Recognised as Number
2,968,390
- Positive
- Even
- Composite
- 7 digits
2,968,390 is an even 7-digit integer and a composite number. It has 16 divisors and a digital root of 1.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value2,968,390
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 × 5 × 101 × 2,939
Distinct prime factors42, 5, 101, 2,939
Number of divisors16
Sum of divisors σ(n)5,397,840
Aliquot sum2,429,450sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,175,200integers below n that share no factor with it
Carmichael function λ(n)146,900the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,175,200
Möbius function μ(n)+14 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 5, 10, 101, 202, 505, 1,010, 2,939, 5,878, 14,695, 29,390, 296,839, 593,678, 1,484,195, 2,968,39016 in total
Arithmetic
Previous number2,968,389
Next number2,968,391
Double5,936,780
Half1,484,195
Square8,811,339,192,100
Cube26,155,491,144,437,719,000
Square root1,722.901622264≈irrational, shown to 9 decimal places
Cube root143.716617327≈
Negation-2,968,390
Reciprocal3.36882957 × 10^-7≈
Representations
Decimal2,968,390
Binary101101010010110100011022 bits
Octal13245506
Hexadecimal2D4B46
Base 361RMFA
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, nine hundred and sixty-eight thousand, three hundred and ninety
Ordinaltwo million, nine hundred and sixty-eight thousand, three hundred and ninetieth
Scientific notation2.96839 × 10^6
Engineering notation2.96839 × 10^6
In other bases
Ternary12120210212101base 3; the most digit-efficient integer base after e: 14 digits
Quinary1224442030base 5; one hand: 10 digits
Septenary34142125base 7: 8 digits
Nonary5523771base 9; each digit is two ternary digits: 7 digits
Duodecimalbb199abase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalib0jabase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal13:44:33:10base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0TT1T110TT101digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11111010101111101011010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001011010100101101000110
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 even
Highest set bitbit 21worth 2,097,152
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes32d 4b 46
Gray code1110111110111011100101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001011010100101101000110
64-bit0000000000000000000000000000000000000000001011010100101101000110
One's complement11111111110100101011010010111001at 32 bits, every bit flipped
Bits reversed01100010110100101011010000000000at 32 bits
Rotated left by 100000000010110101001011010001100at 32 bits, wrapping
Shifted left by 110110101001011010001100= 5,936,780, no wrap
Shifted right by 1101101010010110100011= 1,484,195, discarding the low bit
These bits as a double1.46657952 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,968,390 to the power 28,811,339,192,100
2,968,390 to the power 326,155,491,144,437,719,000
2,968,390 to the power 477,639,698,358,237,480,702,410,000
2,968,390 to the power 5230,464,904,209,608,555,342,226,819,900,000
First ten multiples2,968,390, 5,936,780, 8,905,170, 11,873,560, 14,841,950, 17,810,340, 20,778,730, 23,747,120, 26,715,510, 29,683,900
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 1
Divisible by 4No, remainder 2
Divisible by 5Yes
Divisible by 6No, remainder 4
Divisible by 7No, remainder 5
Divisible by 8No, remainder 6
Divisible by 9No, remainder 1
Divisible by 10Yes
Divisible by 11No, remainder 7
Divisible by 12No, remainder 10
Divisible by 100No, remainder 90
Collatz (3n + 1) trajectory
Steps to reach 1195the total stopping time
Highest value reached6,678,8802× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,968,390 → 1,484,195 → 4,452,586 → 2,226,293 → 6,678,880 → 3,339,440 → 1,669,720 → 834,860 → 417,430 → 208,715 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage296,839,000%
2,968,390% as a decimal29,683.9
2,968,390% of 1002,968,390
2,968,390% of 1,00029,683,900
As a fraction of 1002,968,390/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,968,390
Nerdulate something else
Nothing in mind? Surprise me · today’s page