Recognised as Number
2,376,982
- Positive
- Even
- Composite
- 7 digits
2,376,982 is an even 7-digit integer and a composite number. It has 4 divisors and a digital root of 1.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value2,376,982
Digit count7
Digit sum37
Digit product36,288
Multiplicative persistence3times 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 × 1,188,491
Distinct prime factors22, 1,188,491
Number of divisors4
Sum of divisors σ(n)3,565,476
Aliquot sum1,188,494sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,188,490integers below n that share no factor with it
Carmichael function λ(n)1,188,490the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 1,188,491, 2,376,9824 in total
Arithmetic
Previous number2,376,981
Next number2,376,983
Double4,753,964
Half1,188,491
Square5,650,043,428,324
Cube13,430,051,528,344,438,168
Square root1,541.746412352≈irrational, shown to 9 decimal places
Cube root133.457186307≈
Negation-2,376,982
Reciprocal4.20701545 × 10^-7≈
Representations
Decimal2,376,982
Binary100100010001010001011022 bits
Octal11042426
Hexadecimal244516
Base 361EY3A
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, three hundred and seventy-six thousand, nine hundred and eighty-two
Ordinaltwo million, three hundred and seventy-six thousand, nine hundred and eighty-second
Scientific notation2.376982 × 10^6
Engineering notation2.376982 × 10^6
In other bases
Ternary11110202121101base 3; the most digit-efficient integer base after e: 14 digits
Quinary1102030412base 5; one hand: 10 digits
Septenary26126656base 7: 8 digits
Nonary4422541base 9; each digit is two ternary digits: 7 digits
Duodecimal96769abase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimaleh292base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal11:0:16:22base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary11111T10TT1101digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11001000100010101101010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001001000100010100010110
Bit length22 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits14within that length
Bit parityeven8 set bits, so even; 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
Bytes324 45 16
Gray code1101100110011110011101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001001000100010100010110
64-bit0000000000000000000000000000000000000000001001000100010100010110
One's complement11111111110110111011101011101001at 32 bits, every bit flipped
Bits reversed01101000101000100010010000000000at 32 bits
Rotated left by 100000000010010001000101000101100at 32 bits, wrapping
Shifted left by 110010001000101000101100= 4,753,964, no wrap
Shifted right by 1100100010001010001011= 1,188,491, discarding the low bit
These bits as a double1.17438515 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,376,982 to the power 25,650,043,428,324
2,376,982 to the power 313,430,051,528,344,438,168
2,376,982 to the power 431,922,990,741,947,219,325,448,976
2,376,982 to the power 575,880,374,379,775,185,286,644,357,870,432
First ten multiples2,376,982, 4,753,964, 7,130,946, 9,507,928, 11,884,910, 14,261,892, 16,638,874, 19,015,856, 21,392,838, 23,769,820
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 5No, remainder 2
Divisible by 6No, remainder 4
Divisible by 7No, remainder 6
Divisible by 8No, remainder 6
Divisible by 9No, remainder 1
Divisible by 10No, remainder 2
Divisible by 11No, remainder 3
Divisible by 12No, remainder 10
Divisible by 100No, remainder 82
Collatz (3n + 1) trajectory
Steps to reach 173the total stopping time
Highest value reached5,348,2122× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,376,982 → 1,188,491 → 3,565,474 → 1,782,737 → 5,348,212 → 2,674,106 → 1,337,053 → 4,011,160 → 2,005,580 → 1,002,790 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage237,698,200%
2,376,982% as a decimal23,769.82
2,376,982% of 1002,376,982
2,376,982% of 1,00023,769,820
As a fraction of 1002,376,982/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,376,982
Nerdulate something else
Nothing in mind? Surprise me · today’s page