Recognised as Number
1,163,664
- Positive
- Even
- Composite
- 7 digits
1,163,664 is an even 7-digit integer and a composite number. It has 30 divisors and a digital root of 9.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,163,664
Digit count7
Digit sum27
Digit product2,592
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2^4 × 3^2 × 8,081
Distinct prime factors32, 3, 8,081
Number of divisors30
Sum of divisors σ(n)3,257,046
Aliquot sum2,093,382sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)387,840integers below n that share no factor with it
Carmichael function λ(n)24,240the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 387,840
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 3, 4, 6, 8, 9, 12, 16, 18, 24, 36, 48, 72, 144, 8,081, 16,162, 24,243, 32,324, 48,486, 64,648, 72,729, 96,972, 129,296, 145,458, 193,944, 290,916, 387,888, 581,832, 1,163,66430 in total
Arithmetic
Previous number1,163,663
Next number1,163,665
Double2,327,328
Half581,832
Square1,354,113,904,896
Cube1,575,733,603,026,898,944
Square root1,078.732589663≈irrational, shown to 9 decimal places
Cube root105.182268453≈
Negation-1,163,664
Reciprocal8.5935459 × 10^-7≈
Representations
Decimal1,163,664
Binary10001110000011001000021 bits
Octal4340620
Hexadecimal11C190
Base 36OXW0
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, one hundred and sixty-three thousand, six hundred and sixty-four
Ordinalone million, one hundred and sixty-three thousand, six hundred and sixty-fourth
Scientific notation1.163664 × 10^6
Engineering notation1.163664 × 10^6
In other bases
Ternary2012010020200base 3; the most digit-efficient integer base after e: 13 digits
Quinary244214124base 5; one hand: 9 digits
Septenary12614415base 7: 8 digits
Nonary2163220base 9; each digit is two ternary digits: 7 digits
Duodecimal481500base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal75934base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal5:23:14:24base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1TT0101T1T00digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101101100011010010000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100011100000110010000
Bit length21 bitsto write the magnitude
Set bits7the population count, or Hamming weight
Zero bits14within that length
Bit parityodd7 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
Bytes311 c1 90
Gray code110010010000101011000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100011100000110010000
64-bit0000000000000000000000000000000000000000000100011100000110010000
One's complement11111111111011100011111001101111at 32 bits, every bit flipped
Bits reversed00001001100000111000100000000000at 32 bits
Rotated left by 100000000001000111000001100100000at 32 bits, wrapping
Shifted left by 11000111000001100100000= 2,327,328, no wrap
Shifted right by 110001110000011001000= 581,832, discarding the low bit
These bits as a double5.74926406 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,163,664 to the power 21,354,113,904,896
1,163,664 to the power 31,575,733,603,026,898,944
1,163,664 to the power 41,833,624,467,432,693,332,770,816
1,163,664 to the power 52,133,722,782,270,597,654,385,418,829,824
First ten multiples1,163,664, 2,327,328, 3,490,992, 4,654,656, 5,818,320, 6,981,984, 8,145,648, 9,309,312, 10,472,976, 11,636,640
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 4
Divisible by 6Yes
Divisible by 7No, remainder 5
Divisible by 8Yes
Divisible by 9Yes
Divisible by 10No, remainder 4
Divisible by 11No, remainder 7
Divisible by 12Yes
Divisible by 100No, remainder 64
Collatz (3n + 1) trajectory
Steps to reach 146the total stopping time
Highest value reached1,163,664
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,163,664 → 581,832 → 290,916 → 145,458 → 72,729 → 218,188 → 109,094 → 54,547 → 163,642 → 81,821 → …
Last steps… → 32 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage116,366,400%
1,163,664% as a decimal11,636.64
1,163,664% of 1001,163,664
1,163,664% of 1,00011,636,640
As a fraction of 1001,163,664/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,163,664
Nerdulate something else
Nothing in mind? Surprise me · today’s page