Recognised as Number

1,973,488

Positive
Even
Composite
7 digits

1,973,488 is an even 7-digit integer and a composite number. It has 20 divisors and a digital root of 4.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value1,973,488

Digit count7

Digit sum40

Digit product48,384

Multiplicative persistence3times 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^4 × 11 × 11,213

Distinct prime factors32, 11, 11,213

Number of divisors20

Sum of divisors σ(n)4,171,608

Aliquot sum2,198,120sum of the proper divisors

ClassificationAbundantthe aliquot sum exceeds the number

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

Carmichael function λ(n)56,060the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 896,960

Möbius function μ(n)0zero, because a prime divides n twice

SquarefreeNohas a repeated prime factor

All divisors1, 2, 4, 8, 11, 16, 22, 44, 88, 176, 11,213, 22,426, 44,852, 89,704, 123,343, 179,408, 246,686, 493,372, 986,744, 1,973,48820 in total

Arithmetic

Previous number1,973,487

Next number1,973,489

Double3,946,976

Half986,744

Square3,894,654,886,144

Cube7,686,054,681,946,550,272

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

Cube root125.43290965≈

Negation-1,973,488

Reciprocal5.06717041 × 10^-7≈

Representations

Decimal1,973,488

Binary11110000111001111000021 bits

Octal7416360

Hexadecimal1E1CF0

Base 3616AR4

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

In wordsone million, nine hundred and seventy-three thousand, four hundred and eighty-eight

Ordinalone million, nine hundred and seventy-three thousand, four hundred and eighty-eighth

Scientific notation1.973488 × 10^6

Engineering notation1.973488 × 10^6

In other bases

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

Quinary1001122423base 5; one hand: 10 digits

Septenary22526416base 7: 8 digits

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

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

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

Sexagesimal9:8:11:28base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000000111100001110011110000

Bit length21 bitsto write the magnitude

Set bits11the population count, or Hamming weight

Zero bits10within that length

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

Highest set bitbit 20worth 1,048,576

Lowest set bitbit 44 trailing zeros

Power of twoNo

Bytes31e 1c f0

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

At each machine width

32-bit00000000000111100001110011110000

64-bit0000000000000000000000000000000000000000000111100001110011110000

One's complement11111111111000011110001100001111at 32 bits, every bit flipped

Bits reversed00001111001110000111100000000000at 32 bits

Rotated left by 100000000001111000011100111100000at 32 bits, wrapping

Shifted left by 11111000011100111100000= 3,946,976, no wrap

Shifted right by 111110000111001111000= 986,744, discarding the low bit

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

Nearest landmarks

Next prime1,973,501+13

Previous prime1,973,471−17

Distance to nearest prime13

Nearest square below1,971,216

Nearest square above1,974,025

Powers & multiples

1,973,488 to the power 23,894,654,886,144

1,973,488 to the power 37,686,054,681,946,550,272

1,973,488 to the power 415,168,336,682,165,333,603,188,736

1,973,488 to the power 529,934,530,422,213,099,881,889,732,231,168

First ten multiples1,973,488, 3,946,976, 5,920,464, 7,893,952, 9,867,440, 11,840,928, 13,814,416, 15,787,904, 17,761,392, 19,734,880

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

Divisible by 5No, remainder 3

Divisible by 6No, remainder 4

Divisible by 7No, remainder 6

Divisible by 8Yes

Divisible by 9No, remainder 4

Divisible by 10No, remainder 8

Divisible by 11Yes

Divisible by 12No, remainder 4

Divisible by 100No, remainder 88

Collatz (3n + 1) trajectory

Steps to reach 1171the total stopping time

Highest value reached1,973,488

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

First steps1,973,488 → 986,744 → 493,372 → 246,686 → 123,343 → 370,030 → 185,015 → 555,046 → 277,523 → 832,570 → …

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

As a percentage & fraction

As a percentage197,348,800%

1,973,488% as a decimal19,734.88

1,973,488% of 1001,973,488

1,973,488% of 1,00019,734,880

As a fraction of 1001,973,488/100

Read another way

As seconds22 days, 20 hours and 11 minutes

As bytes1.882 MiB

As a 24-bit colour#1E1CF0

Keep nerding

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