Recognised as Number

1,982,965

Positive
Odd
Composite
7 digits

1,982,965 is an odd 7-digit integer and a composite number. It has 16 divisors and a digital root of 4.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value1,982,965

Digit count7

Digit sum40

Digit product38,880

Multiplicative persistence2times 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 factorisation5 × 17 × 41 × 569

Distinct prime factors45, 17, 41, 569

Number of divisors16

Sum of divisors σ(n)2,585,520

Aliquot sum602,555sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)1,454,080integers below n that share no factor with it

Carmichael function λ(n)5,680the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,454,080

Möbius function μ(n)+14 distinct prime factors, an even number of them

SquarefreeYesno repeated prime factor

All divisors1, 5, 17, 41, 85, 205, 569, 697, 2,845, 3,485, 9,673, 23,329, 48,365, 116,645, 396,593, 1,982,96516 in total

Arithmetic

Previous number1,982,964

Next number1,982,966

Double3,965,930

Half991,482.5

Square3,932,150,191,225

Cube7,797,316,203,942,482,125

Square root1,408.177900693≈irrational, shown to 9 decimal places

Cube root125.633371966≈

Negation-1,982,965

Reciprocal5.04295336 × 10^-7≈

Representations

Decimal1,982,965

Binary11110010000011111010121 bits

Octal7440765

Hexadecimal1E41F5

Base 3616I2D

Roman numeralNot defined above 3,999there is no agreed standard notation

In wordsone million, nine hundred and eighty-two thousand, nine hundred and sixty-five

Ordinalone million, nine hundred and eighty-two thousand, nine hundred and sixty-fifth

Scientific notation1.982965 × 10^6

Engineering notation1.982965 × 10^6

In other bases

Ternary10201202010011base 3; the most digit-efficient integer base after e: 14 digits

Quinary1001423330base 5; one hand: 10 digits

Septenary22566145base 7: 8 digits

Nonary3652104base 9; each digit is two ternary digits: 7 digits

Duodecimal7b7671base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits

Vigesimalc7h85base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits

Sexagesimal9:10:49:25base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

Balanced ternary11T1TT1T010011digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed

Negabinary11000100100011000110101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000000111100100000111110101

Bit length21 bitsto write the magnitude

Set bits12the population count, or Hamming weight

Zero bits9within that length

Bit parityeven12 set bits, so even; not the same as the number itself being odd

Highest set bitbit 20worth 1,048,576

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes31e 41 f5

Gray code100010110000100001111n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000000111100100000111110101

64-bit0000000000000000000000000000000000000000000111100100000111110101

One's complement11111111111000011011111000001010at 32 bits, every bit flipped

Bits reversed10101111100000100111100000000000at 32 bits

Rotated left by 100000000001111001000001111101010at 32 bits, wrapping

Shifted left by 11111001000001111101010= 3,965,930, no wrap

Shifted right by 111110010000011111010= 991,482, discarding the low bit

These bits as a double9.79714883 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime1,982,969+4

Previous prime1,982,957−8

Distance to nearest prime4

Nearest square below1,982,464

Nearest square above1,985,281

Powers & multiples

1,982,965 to the power 23,932,150,191,225

1,982,965 to the power 37,797,316,203,942,482,125

1,982,965 to the power 415,461,805,126,350,804,067,000,625

1,982,965 to the power 530,660,218,402,374,222,186,719,894,353,125

First ten multiples1,982,965, 3,965,930, 5,948,895, 7,931,860, 9,914,825, 11,897,790, 13,880,755, 15,863,720, 17,846,685, 19,829,650

Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 1

Divisible by 4No, remainder 1

Divisible by 5Yes

Divisible by 6No, remainder 1

Divisible by 7No, remainder 5

Divisible by 8No, remainder 5

Divisible by 9No, remainder 4

Divisible by 10No, remainder 5

Divisible by 11No, remainder 6

Divisible by 12No, remainder 1

Divisible by 100No, remainder 65

Collatz (3n + 1) trajectory

Steps to reach 196the total stopping time

Highest value reached9,045,1604× the starting value

Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven

First steps1,982,965 → 5,948,896 → 2,974,448 → 1,487,224 → 743,612 → 371,806 → 185,903 → 557,710 → 278,855 → 836,566 → …

Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage198,296,500%

1,982,965% as a decimal19,829.65

1,982,965% of 1001,982,965

1,982,965% of 1,00019,829,650

As a fraction of 1001,982,965/100

Read another way

As seconds22 days, 22 hours and 49 minutes

As bytes1.891 MiB

As a 24-bit colour#1E41F5

Keep nerding

Every link below is a page Nerdulator can generate from what it already knows about this value.