Recognised as Number

1,960,690

Positive
Even
Composite
7 digits

1,960,690 is an even 7-digit integer and a composite number. It has 16 divisors and a digital root of 4.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value1,960,690

Digit count7

Digit sum31

Digit product0zero, because one of the digits is zero

Multiplicative persistence1times 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 factorisation2 × 5 × 29 × 6,761

Distinct prime factors42, 5, 29, 6,761

Number of divisors16

Sum of divisors σ(n)3,651,480

Aliquot sum1,690,790sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)757,120integers below n that share no factor with it

Carmichael function λ(n)47,320the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 757,120

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

SquarefreeYesno repeated prime factor

All divisors1, 2, 5, 10, 29, 58, 145, 290, 6,761, 13,522, 33,805, 67,610, 196,069, 392,138, 980,345, 1,960,69016 in total

Arithmetic

Previous number1,960,689

Next number1,960,691

Double3,921,380

Half980,345

Square3,844,305,276,100

Cube7,537,490,911,796,509,000

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

Cube root125.161178749≈

Negation-1,960,690

Reciprocal5.10024532 × 10^-7≈

Representations

Decimal1,960,690

Binary11101111010101111001021 bits

Octal7365362

Hexadecimal1DEAF2

Base 36160VM

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

In wordsone million, nine hundred and sixty thousand, six hundred and ninety

Ordinalone million, nine hundred and sixty thousand, six hundred and ninetieth

Scientific notation1.96069 × 10^6

Engineering notation1.96069 × 10^6

In other bases

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

Quinary1000220230base 5; one hand: 10 digits

Septenary22444204base 7: 8 digits

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

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

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

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

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

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

Bit-level

00000000000111011110101011110010

Bit length21 bitsto write the magnitude

Set bits14the population count, or Hamming weight

Zero bits7within that length

Bit parityeven14 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

Bytes31d ea f2

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

At each machine width

32-bit00000000000111011110101011110010

64-bit0000000000000000000000000000000000000000000111011110101011110010

One's complement11111111111000100001010100001101at 32 bits, every bit flipped

Bits reversed01001111010101111011100000000000at 32 bits

Rotated left by 100000000001110111101010111100100at 32 bits, wrapping

Shifted left by 11110111101010111100100= 3,921,380, no wrap

Shifted right by 111101111010101111001= 980,345, discarding the low bit

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

Nearest landmarks

Next prime1,960,703+13

Previous prime1,960,669−21

Distance to nearest prime13

Nearest square below1,960,000

Nearest square above1,962,801

Powers & multiples

1,960,690 to the power 23,844,305,276,100

1,960,690 to the power 37,537,490,911,796,509,000

1,960,690 to the power 414,778,683,055,850,297,231,210,000

1,960,690 to the power 528,976,416,080,775,119,278,261,134,900,000

First ten multiples1,960,690, 3,921,380, 5,882,070, 7,842,760, 9,803,450, 11,764,140, 13,724,830, 15,685,520, 17,646,210, 19,606,900

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 5Yes

Divisible by 6No, remainder 4

Divisible by 7No, remainder 4

Divisible by 8No, remainder 2

Divisible by 9No, remainder 4

Divisible by 10Yes

Divisible by 11No, remainder 6

Divisible by 12No, remainder 10

Divisible by 100No, remainder 90

Collatz (3n + 1) trajectory

Steps to reach 1153the total stopping time

Highest value reached12,562,6126× the starting value

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

First steps1,960,690 → 980,345 → 2,941,036 → 1,470,518 → 735,259 → 2,205,778 → 1,102,889 → 3,308,668 → 1,654,334 → 827,167 → …

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

As a percentage & fraction

As a percentage196,069,000%

1,960,690% as a decimal19,606.9

1,960,690% of 1001,960,690

1,960,690% of 1,00019,606,900

As a fraction of 1001,960,690/100

Read another way

As seconds22 days, 16 hours and 38 minutes

As bytes1.87 MiB

As a 24-bit colour#1DEAF2

Keep nerding

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