Recognised as Number
1,344,386
- Positive
- Even
- Composite
- 7 digits
1,344,386 is an even 7-digit integer and a composite number. It has 4 divisors and a digital root of 2.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,344,386
Digit count7
Digit sum29
Digit product6,912
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2 × 672,193
Distinct prime factors22, 672,193
Number of divisors4
Sum of divisors σ(n)2,016,582
Aliquot sum672,196sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)672,192integers below n that share no factor with it
Carmichael function λ(n)672,192the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 672,193, 1,344,3864 in total
Arithmetic
Previous number1,344,385
Next number1,344,387
Double2,688,772
Half672,193
Square1,807,373,716,996
Cube2,429,807,921,897,384,456
Square root1,159.47660606≈irrational, shown to 9 decimal places
Cube root110.367530972≈
Negation-1,344,386
Reciprocal7.43833988 × 10^-7≈
Representations
Decimal1,344,386
Binary10100100000111000001021 bits
Octal5101602
Hexadecimal148382
Base 36STC2
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, three hundred and forty-four thousand, three hundred and eighty-six
Ordinalone million, three hundred and forty-four thousand, three hundred and eighty-sixth
Scientific notation1.344386 × 10^6
Engineering notation1.344386 × 10^6
In other bases
Ternary2112022011002base 3; the most digit-efficient integer base after e: 13 digits
Quinary321010021base 5; one hand: 9 digits
Septenary14266331base 7: 8 digits
Nonary2468132base 9; each digit is two ternary digits: 7 digits
Duodecimal54a002base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal880j6base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal6:13:26:26base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10TTT10T01101Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101011000010010000110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000101001000001110000010
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 11 trailing zero
Power of twoNo
Bytes314 83 82
Gray code111101100001001000011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000101001000001110000010
64-bit0000000000000000000000000000000000000000000101001000001110000010
One's complement11111111111010110111110001111101at 32 bits, every bit flipped
Bits reversed01000001110000010010100000000000at 32 bits
Rotated left by 100000000001010010000011100000100at 32 bits, wrapping
Shifted left by 11010010000011100000100= 2,688,772, no wrap
Shifted right by 110100100000111000001= 672,193, discarding the low bit
These bits as a double6.64214937 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,344,386 to the power 21,807,373,716,996
1,344,386 to the power 32,429,807,921,897,384,456
1,344,386 to the power 43,266,599,752,887,937,099,264,016
1,344,386 to the power 54,391,570,975,386,002,205,131,153,414,176
First ten multiples1,344,386, 2,688,772, 4,033,158, 5,377,544, 6,721,930, 8,066,316, 9,410,702, 10,755,088, 12,099,474, 13,443,860
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 2
Divisible by 4No, remainder 2
Divisible by 5No, remainder 1
Divisible by 6No, remainder 2
Divisible by 7No, remainder 1
Divisible by 8No, remainder 2
Divisible by 9No, remainder 2
Divisible by 10No, remainder 6
Divisible by 11No, remainder 10
Divisible by 12No, remainder 2
Divisible by 100No, remainder 86
Collatz (3n + 1) trajectory
Steps to reach 1186the total stopping time
Highest value reached9,198,5206× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,344,386 → 672,193 → 2,016,580 → 1,008,290 → 504,145 → 1,512,436 → 756,218 → 378,109 → 1,134,328 → 567,164 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage134,438,600%
1,344,386% as a decimal13,443.86
1,344,386% of 1001,344,386
1,344,386% of 1,00013,443,860
As a fraction of 1001,344,386/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,344,386
Nerdulate something else
Nothing in mind? Surprise me · today’s page