Recognised as Number

1,997,146

Positive
Even
Composite
7 digits

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

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value1,997,146

Digit count7

Digit sum37

Digit product13,608

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

Digital root1repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 53 × 83 × 227

Distinct prime factors42, 53, 83, 227

Number of divisors16

Sum of divisors σ(n)3,102,624

Aliquot sum1,105,478sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)240,916the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 963,664

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

SquarefreeYesno repeated prime factor

All divisors1, 2, 53, 83, 106, 166, 227, 454, 4,399, 8,798, 12,031, 18,841, 24,062, 37,682, 998,573, 1,997,14616 in total

Arithmetic

Previous number1,997,145

Next number1,997,147

Double3,994,292

Half998,573

Square3,988,592,145,316

Cube7,965,800,848,649,268,136

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

Cube root125.932146215≈

Negation-1,997,146

Reciprocal5.0071452 × 10^-7≈

Representations

Decimal1,997,146

Binary11110011110010101101021 bits

Octal7474532

Hexadecimal1E795A

Base 3616T0A

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

In wordsone million, nine hundred and ninety-seven thousand, one hundred and forty-six

Ordinalone million, nine hundred and ninety-seven thousand, one hundred and forty-sixth

Scientific notation1.997146 × 10^6

Engineering notation1.997146 × 10^6

In other bases

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

Quinary1002402041base 5; one hand: 10 digits

Septenary22655404base 7: 8 digits

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

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

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

Sexagesimal9:14:45:46base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000000111100111100101011010

Bit length21 bitsto write the magnitude

Set bits13the population count, or Hamming weight

Zero bits8within that length

Bit parityodd13 set bits, so odd; 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 79 5a

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

At each machine width

32-bit00000000000111100111100101011010

64-bit0000000000000000000000000000000000000000000111100111100101011010

One's complement11111111111000011000011010100101at 32 bits, every bit flipped

Bits reversed01011010100111100111100000000000at 32 bits

Rotated left by 100000000001111001111001010110100at 32 bits, wrapping

Shifted left by 11111001111001010110100= 3,994,292, no wrap

Shifted right by 111110011110010101101= 998,573, discarding the low bit

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

Nearest landmarks

Next prime1,997,161+15

Previous prime1,997,141−5

Distance to nearest prime5

Nearest square below1,996,569

Nearest square above1,999,396

Powers & multiples

1,997,146 to the power 23,988,592,145,316

1,997,146 to the power 37,965,800,848,649,268,136

1,997,146 to the power 415,908,867,301,676,491,260,739,856

1,997,146 to the power 531,772,330,696,073,997,815,421,560,450,976

First ten multiples1,997,146, 3,994,292, 5,991,438, 7,988,584, 9,985,730, 11,982,876, 13,980,022, 15,977,168, 17,974,314, 19,971,460

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 1

Divisible by 6No, remainder 4

Divisible by 7No, remainder 4

Divisible by 8No, remainder 2

Divisible by 9No, remainder 1

Divisible by 10No, remainder 6

Divisible by 11No, remainder 8

Divisible by 12No, remainder 10

Divisible by 100No, remainder 46

Collatz (3n + 1) trajectory

Steps to reach 1153the total stopping time

Highest value reached2,995,7201× the starting value

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

First steps1,997,146 → 998,573 → 2,995,720 → 1,497,860 → 748,930 → 374,465 → 1,123,396 → 561,698 → 280,849 → 842,548 → …

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

As a percentage & fraction

As a percentage199,714,600%

1,997,146% as a decimal19,971.46

1,997,146% of 1001,997,146

1,997,146% of 1,00019,971,460

As a fraction of 1001,997,146/100

Read another way

As seconds23 days, 2 hours and 45 minutes

As bytes1.905 MiB

As a 24-bit colour#1E795A

Keep nerding

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