Recognised as Number
1,980,538
- Positive
- Even
- Composite
- 7 digits
1,980,538 is an even 7-digit integer and a composite number. It has 16 divisors and a digital root of 7.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,980,538
Digit count7
Digit sum34
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times 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 factorisation2 × 7 × 241 × 587
Distinct prime factors42, 7, 241, 587
Number of divisors16
Sum of divisors σ(n)3,415,104
Aliquot sum1,434,566sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)843,840integers below n that share no factor with it
Carmichael function λ(n)70,320the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 843,840
Möbius function μ(n)+14 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 7, 14, 241, 482, 587, 1,174, 1,687, 3,374, 4,109, 8,218, 141,467, 282,934, 990,269, 1,980,53816 in total
Arithmetic
Previous number1,980,537
Next number1,980,539
Double3,961,076
Half990,269
Square3,922,530,769,444
Cube7,768,721,245,053,080,872
Square root1,407.315884938≈irrational, shown to 9 decimal places
Cube root125.582095775≈
Negation-1,980,538
Reciprocal5.04913311 × 10^-7≈
Representations
Decimal1,980,538
Binary11110001110000111101021 bits
Octal7434172
Hexadecimal1E387A
Base 3616G6Y
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, nine hundred and eighty thousand, five hundred and thirty-eight
Ordinalone million, nine hundred and eighty thousand, five hundred and thirty-eighth
Scientific notation1.980538 × 10^6
Engineering notation1.980538 × 10^6
In other bases
Ternary10201121210021base 3; the most digit-efficient integer base after e: 14 digits
Quinary1001334123base 5; one hand: 10 digits
Septenary22556110base 7: 8 digits
Nonary3647707base 9; each digit is two ternary digits: 7 digits
Duodecimal7b618abase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalc7b6ibase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal9:10:8:58base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary11T1TT0TT101T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11000100100100110001110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000111100011100001111010
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 even
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes31e 38 7a
Gray code100010010010001000111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000111100011100001111010
64-bit0000000000000000000000000000000000000000000111100011100001111010
One's complement11111111111000011100011110000101at 32 bits, every bit flipped
Bits reversed01011110000111000111100000000000at 32 bits
Rotated left by 100000000001111000111000011110100at 32 bits, wrapping
Shifted left by 11111000111000011110100= 3,961,076, no wrap
Shifted right by 111110001110000111101= 990,269, discarding the low bit
These bits as a double9.78515786 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,980,538 to the power 23,922,530,769,444
1,980,538 to the power 37,768,721,245,053,080,872
1,980,538 to the power 415,386,247,637,234,938,684,069,136
1,980,538 to the power 530,473,048,122,954,010,991,468,918,475,168
First ten multiples1,980,538, 3,961,076, 5,941,614, 7,922,152, 9,902,690, 11,883,228, 13,863,766, 15,844,304, 17,824,842, 19,805,380
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 1
Divisible by 4No, remainder 2
Divisible by 5No, remainder 3
Divisible by 6No, remainder 4
Divisible by 7Yes
Divisible by 8No, remainder 2
Divisible by 9No, remainder 7
Divisible by 10No, remainder 8
Divisible by 11No, remainder 10
Divisible by 12No, remainder 10
Divisible by 100No, remainder 38
Collatz (3n + 1) trajectory
Steps to reach 1122the total stopping time
Highest value reached2,970,8081× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,980,538 → 990,269 → 2,970,808 → 1,485,404 → 742,702 → 371,351 → 1,114,054 → 557,027 → 1,671,082 → 835,541 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage198,053,800%
1,980,538% as a decimal19,805.38
1,980,538% of 1001,980,538
1,980,538% of 1,00019,805,380
As a fraction of 1001,980,538/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 1,980,538
Nerdulate something else
Nothing in mind? Surprise me · today’s page