Recognised as Number
1,663,792
- Positive
- Even
- Composite
- 7 digits
1,663,792 is an even 7-digit integer and a composite number. It has 40 divisors and a digital root of 7.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,663,792
Digit count7
Digit sum34
Digit product13,608
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2^4 × 13 × 19 × 421
Distinct prime factors42, 13, 19, 421
Number of divisors40
Sum of divisors σ(n)3,662,960
Aliquot sum1,999,168sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)725,760integers below n that share no factor with it
Carmichael function λ(n)1,260the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 725,760
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 8, 13, 16, 19, 26, 38, 52, 76, 104, 152, 208, 247, 304, 421, 494, 842, 988, 1,684, 1,976, 3,368, 3,952, 5,473, 6,736, 7,999, 10,946, 15,998, 21,892, 31,996, 43,784, 63,992, 87,568, 103,987, 127,984, 207,974, 415,948, 831,896, 1,663,79240 in total
Arithmetic
Previous number1,663,791
Next number1,663,793
Double3,327,584
Half831,896
Square2,768,203,819,264
Cube4,605,715,368,860,889,088
Square root1,289.880614631≈irrational, shown to 9 decimal places
Cube root118.494905037≈
Negation-1,663,792
Reciprocal6.01036668 × 10^-7≈
Representations
Decimal1,663,792
Binary11001011000110011000021 bits
Octal6261460
Hexadecimal196330
Base 36ZNSG
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, six hundred and sixty-three thousand, seven hundred and ninety-two
Ordinalone million, six hundred and sixty-three thousand, seven hundred and ninety-second
Scientific notation1.663792 × 10^6
Engineering notation1.663792 × 10^6
In other bases
Ternary10010112021221base 3; the most digit-efficient integer base after e: 14 digits
Quinary411220132base 5; one hand: 9 digits
Septenary20066464base 7: 8 digits
Nonary3115257base 9; each digit is two ternary digits: 7 digits
Duodecimal682a14base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimala7j9cbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal7:42:9:52base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10011TTT10T0T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11011101010011101110000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000110010110001100110000
Bit length21 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits12within that length
Bit parityodd9 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
Bytes319 63 30
Gray code101011101001010101000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000110010110001100110000
64-bit0000000000000000000000000000000000000000000110010110001100110000
One's complement11111111111001101001110011001111at 32 bits, every bit flipped
Bits reversed00001100110001101001100000000000at 32 bits
Rotated left by 100000000001100101100011001100000at 32 bits, wrapping
Shifted left by 11100101100011001100000= 3,327,584, no wrap
Shifted right by 111001011000110011000= 831,896, discarding the low bit
These bits as a double8.22022469 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,663,792 to the power 22,768,203,819,264
1,663,792 to the power 34,605,715,368,860,889,088
1,663,792 to the power 47,662,952,384,987,796,377,501,696
1,663,792 to the power 512,749,558,874,523,615,710,516,301,791,232
First ten multiples1,663,792, 3,327,584, 4,991,376, 6,655,168, 8,318,960, 9,982,752, 11,646,544, 13,310,336, 14,974,128, 16,637,920
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 2
Divisible by 6No, remainder 4
Divisible by 7No, remainder 4
Divisible by 8Yes
Divisible by 9No, remainder 7
Divisible by 10No, remainder 2
Divisible by 11No, remainder 9
Divisible by 12No, remainder 4
Divisible by 100No, remainder 92
Collatz (3n + 1) trajectory
Steps to reach 1176the total stopping time
Highest value reached1,663,792
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,663,792 → 831,896 → 415,948 → 207,974 → 103,987 → 311,962 → 155,981 → 467,944 → 233,972 → 116,986 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage166,379,200%
1,663,792% as a decimal16,637.92
1,663,792% of 1001,663,792
1,663,792% of 1,00016,637,920
As a fraction of 1001,663,792/100
Read another way
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from 1,663,792
Nerdulate something else
Nothing in mind? Surprise me · today’s page