Recognised as Number

1,663,968

Positive
Even
Composite
7 digits

1,663,968 is an even 7-digit integer and a composite number. It has 24 divisors and a digital root of 3.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value1,663,968

Digit count7

Digit sum39

Digit product46,656

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

Digital root3repeated digit sum

PalindromicNoreads differently backwards

Happy numberYessquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2^5 × 3 × 17,333

Distinct prime factors32, 3, 17,333

Number of divisors24

Sum of divisors σ(n)4,368,168

Aliquot sum2,704,200sum of the proper divisors

ClassificationAbundantthe aliquot sum exceeds the number

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

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

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

SquarefreeNohas a repeated prime factor

All divisors1, 2, 3, 4, 6, 8, 12, 16, 24, 32, 48, 96, 17,333, 34,666, 51,999, 69,332, 103,998, 138,664, 207,996, 277,328, 415,992, 554,656, 831,984, 1,663,96824 in total

Arithmetic

Previous number1,663,967

Next number1,663,969

Double3,327,936

Half831,984

Square2,768,789,505,024

Cube4,607,177,135,095,775,232

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

Cube root118.499083117≈

Negation-1,663,968

Reciprocal6.00973096 × 10^-7≈

Representations

Decimal1,663,968

Binary11001011000111110000021 bits

Octal6261740

Hexadecimal1963E0

Base 36ZNXC

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

In wordsone million, six hundred and sixty-three thousand, nine hundred and sixty-eight

Ordinalone million, six hundred and sixty-three thousand, nine hundred and sixty-eighth

Scientific notation1.663968 × 10^6

Engineering notation1.663968 × 10^6

In other bases

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

Quinary411221333base 5; one hand: 9 digits

Septenary20100135base 7: 8 digits

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

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

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

Sexagesimal7:42:12:48base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000000110010110001111100000

Bit length21 bitsto write the magnitude

Set bits10the population count, or Hamming weight

Zero bits11within that length

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

Highest set bitbit 20worth 1,048,576

Lowest set bitbit 55 trailing zeros

Power of twoNo

Bytes319 63 e0

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

At each machine width

32-bit00000000000110010110001111100000

64-bit0000000000000000000000000000000000000000000110010110001111100000

One's complement11111111111001101001110000011111at 32 bits, every bit flipped

Bits reversed00000111110001101001100000000000at 32 bits

Rotated left by 100000000001100101100011111000000at 32 bits, wrapping

Shifted left by 11100101100011111000000= 3,327,936, no wrap

Shifted right by 111001011000111110000= 831,984, discarding the low bit

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

Nearest landmarks

Next prime1,663,973+5

Previous prime1,663,967−1

Distance to nearest prime1

Nearest square below1,661,521

Nearest square above1,664,100

Powers & multiples

1,663,968 to the power 22,768,789,505,024

1,663,968 to the power 34,607,177,135,095,775,232

1,663,968 to the power 47,666,195,323,131,046,921,240,576

1,663,968 to the power 512,756,303,699,439,721,883,442,838,765,568

First ten multiples1,663,968, 3,327,936, 4,991,904, 6,655,872, 8,319,840, 9,983,808, 11,647,776, 13,311,744, 14,975,712, 16,639,680

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

Divisibility tests

Divisible by 2Yes

Divisible by 3Yes

Divisible by 4Yes

Divisible by 5No, remainder 3

Divisible by 6Yes

Divisible by 7No, remainder 5

Divisible by 8Yes

Divisible by 9No, remainder 3

Divisible by 10No, remainder 8

Divisible by 11No, remainder 9

Divisible by 12Yes

Divisible by 100No, remainder 68

Collatz (3n + 1) trajectory

Steps to reach 1207the total stopping time

Highest value reached1,663,968

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

First steps1,663,968 → 831,984 → 415,992 → 207,996 → 103,998 → 51,999 → 155,998 → 77,999 → 233,998 → 116,999 → …

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

As a percentage & fraction

As a percentage166,396,800%

1,663,968% as a decimal16,639.68

1,663,968% of 1001,663,968

1,663,968% of 1,00016,639,680

As a fraction of 1001,663,968/100

Read another way

As seconds19 days, 6 hours and 12 minutes

As bytes1.587 MiB

As a 24-bit colour#1963E0

Keep nerding

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