Recognised as Number
1,311,366
- Positive
- Even
- Composite
- 7 digits
1,311,366 is an even 7-digit integer and a composite number. It has 16 divisors and a digital root of 3.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,311,366
Digit count7
Digit sum21
Digit product324
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root3repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberYesdivisible by its own digit sum
Factors & divisors
Prime factorisation2 × 3 × 7 × 31,223
Distinct prime factors42, 3, 7, 31,223
Number of divisors16
Sum of divisors σ(n)2,997,504
Aliquot sum1,686,138sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)374,664integers below n that share no factor with it
Carmichael function λ(n)93,666the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 374,664
Möbius function μ(n)+14 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 3, 6, 7, 14, 21, 42, 31,223, 62,446, 93,669, 187,338, 218,561, 437,122, 655,683, 1,311,36616 in total
Arithmetic
Previous number1,311,365
Next number1,311,367
Double2,622,732
Half655,683
Square1,719,680,785,956
Cube2,255,130,913,555,975,896
Square root1,145.148898615≈irrational, shown to 9 decimal places
Cube root109.456436874≈
Negation-1,311,366
Reciprocal7.62563617 × 10^-7≈
Representations
Decimal1,311,366
Binary10100000000101000011021 bits
Octal5001206
Hexadecimal140286
Base 36S3UU
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, three hundred and eleven thousand, three hundred and sixty-six
Ordinalone million, three hundred and eleven thousand, three hundred and sixty-sixth
Scientific notation1.311366 × 10^6
Engineering notation1.311366 × 10^6
In other bases
Ternary2110121212010base 3; the most digit-efficient integer base after e: 13 digits
Quinary313430431base 5; one hand: 9 digits
Septenary14101140base 7: 8 digits
Nonary2417763base 9; each digit is two ternary digits: 7 digits
Duodecimal532a86base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal83i86base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal6:4:16:6base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T111T0T0TT010digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101000000011110011010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000101000000001010000110
Bit length21 bitsto write the magnitude
Set bits6the population count, or Hamming weight
Zero bits15within that length
Bit parityeven6 set bits, so even; 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
Bytes314 02 86
Gray code111100000001111000101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000101000000001010000110
64-bit0000000000000000000000000000000000000000000101000000001010000110
One's complement11111111111010111111110101111001at 32 bits, every bit flipped
Bits reversed01100001010000000010100000000000at 32 bits
Rotated left by 100000000001010000000010100001100at 32 bits, wrapping
Shifted left by 11010000000010100001100= 2,622,732, no wrap
Shifted right by 110100000000101000011= 655,683, discarding the low bit
These bits as a double6.4790089 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,311,366 to the power 21,719,680,785,956
1,311,366 to the power 32,255,130,913,555,975,896
1,311,366 to the power 42,957,302,005,586,245,886,833,936
1,311,366 to the power 53,878,105,301,857,612,923,633,871,316,576
First ten multiples1,311,366, 2,622,732, 3,934,098, 5,245,464, 6,556,830, 7,868,196, 9,179,562, 10,490,928, 11,802,294, 13,113,660
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2Yes
Divisible by 3Yes
Divisible by 4No, remainder 2
Divisible by 5No, remainder 1
Divisible by 6Yes
Divisible by 7Yes
Divisible by 8No, remainder 6
Divisible by 9No, remainder 3
Divisible by 10No, remainder 6
Divisible by 11No, remainder 1
Divisible by 12No, remainder 6
Divisible by 100No, remainder 66
Collatz (3n + 1) trajectory
Steps to reach 1155the total stopping time
Highest value reached3,544,7202× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,311,366 → 655,683 → 1,967,050 → 983,525 → 2,950,576 → 1,475,288 → 737,644 → 368,822 → 184,411 → 553,234 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage131,136,600%
1,311,366% as a decimal13,113.66
1,311,366% of 1001,311,366
1,311,366% of 1,00013,113,660
As a fraction of 1001,311,366/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,311,366
Nerdulate something else
Nothing in mind? Surprise me · today’s page