Recognised as Number

1,974,608

Positive
Even
Composite
7 digits

1,974,608 is an even 7-digit integer and a composite number. It has 20 divisors and a digital root of 8.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value1,974,608

Digit count7

Digit sum35

Digit product0zero, because one of the digits is zero

Multiplicative persistence1times the digit product can be taken before one digit is left

Digital root8repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2^4 × 167 × 739

Distinct prime factors32, 167, 739

Number of divisors20

Sum of divisors σ(n)3,853,920

Aliquot sum1,879,312sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)122,508the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 980,064

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

SquarefreeNohas a repeated prime factor

All divisors1, 2, 4, 8, 16, 167, 334, 668, 739, 1,336, 1,478, 2,672, 2,956, 5,912, 11,824, 123,413, 246,826, 493,652, 987,304, 1,974,60820 in total

Arithmetic

Previous number1,974,607

Next number1,974,609

Double3,949,216

Half987,304

Square3,899,076,753,664

Cube7,699,148,150,398,963,712

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

Cube root125.456633853≈

Negation-1,974,608

Reciprocal5.06429631 × 10^-7≈

Representations

Decimal1,974,608

Binary11110001000010101000021 bits

Octal7420520

Hexadecimal1E2150

Base 3616BM8

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

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

Ordinalone million, nine hundred and seventy-four thousand, six hundred and eighth

Scientific notation1.974608 × 10^6

Engineering notation1.974608 × 10^6

In other bases

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

Quinary1001141413base 5; one hand: 10 digits

Septenary22532606base 7: 8 digits

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

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

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

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

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

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

Bit-level

00000000000111100010000101010000

Bit length21 bitsto write the magnitude

Set bits8the population count, or Hamming weight

Zero bits13within that length

Bit parityeven8 set bits, so even; 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 21 50

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

At each machine width

32-bit00000000000111100010000101010000

64-bit0000000000000000000000000000000000000000000111100010000101010000

One's complement11111111111000011101111010101111at 32 bits, every bit flipped

Bits reversed00001010100001000111100000000000at 32 bits

Rotated left by 100000000001111000100001010100000at 32 bits, wrapping

Shifted left by 11111000100001010100000= 3,949,216, no wrap

Shifted right by 111110001000010101000= 987,304, discarding the low bit

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

Nearest landmarks

Next prime1,974,641+33

Previous prime1,974,569−39

Distance to nearest prime33

Nearest square below1,974,025

Nearest square above1,976,836

Powers & multiples

1,974,608 to the power 23,899,076,753,664

1,974,608 to the power 37,699,148,150,398,963,712

1,974,608 to the power 415,202,799,530,962,996,937,424,896

1,974,608 to the power 530,019,569,576,235,781,456,614,699,040,768

First ten multiples1,974,608, 3,949,216, 5,923,824, 7,898,432, 9,873,040, 11,847,648, 13,822,256, 15,796,864, 17,771,472, 19,746,080

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

Divisibility tests

Divisible by 2Yes

Divisible by 3No, remainder 2

Divisible by 4Yes

Divisible by 5No, remainder 3

Divisible by 6No, remainder 2

Divisible by 7No, remainder 6

Divisible by 8Yes

Divisible by 9No, remainder 8

Divisible by 10No, remainder 8

Divisible by 11No, remainder 9

Divisible by 12No, remainder 8

Divisible by 100No, remainder 8

Collatz (3n + 1) trajectory

Steps to reach 191the total stopping time

Highest value reached1,974,608

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

First steps1,974,608 → 987,304 → 493,652 → 246,826 → 123,413 → 370,240 → 185,120 → 92,560 → 46,280 → 23,140 → …

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

As a percentage & fraction

As a percentage197,460,800%

1,974,608% as a decimal19,746.08

1,974,608% of 1001,974,608

1,974,608% of 1,00019,746,080

As a fraction of 1001,974,608/100

Read another way

As seconds22 days, 20 hours and 30 minutes

As bytes1.883 MiB

As a 24-bit colour#1E2150

Keep nerding

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