Recognised as Number
1,341,191
- Positive
- Odd
- Composite
- 7 digits
1,341,191 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,341,191
Digit count7
Digit sum20
Digit product108
Multiplicative persistence2times 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 factorisation19 × 70,589
Distinct prime factors219, 70,589
Number of divisors4
Sum of divisors σ(n)1,411,800
Aliquot sum70,609sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,270,584integers below n that share no factor with it
Carmichael function λ(n)635,292the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,270,584
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 19, 70,589, 1,341,1914 in total
Arithmetic
Previous number1,341,190
Next number1,341,192
Double2,682,382
Half670,595.5
Square1,798,793,298,481
Cube2,412,525,382,783,030,871
Square root1,158.098009669≈irrational, shown to 9 decimal places
Cube root110.280030315≈
Negation-1,341,191
Reciprocal7.45605958 × 10^-7≈
Representations
Decimal1,341,191
Binary10100011101110000011121 bits
Octal5073407
Hexadecimal147707
Base 36SQVB
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, three hundred and forty-one thousand, one hundred and ninety-one
Ordinalone million, three hundred and forty-one thousand, one hundred and ninety-first
Scientific notation1.341191 × 10^6
Engineering notation1.341191 × 10^6
In other bases
Ternary2112010202202base 3; the most digit-efficient integer base after e: 13 digits
Quinary320404231base 5; one hand: 9 digits
Septenary14254115base 7: 8 digits
Nonary2463682base 9; each digit is two ternary digits: 7 digits
Duodecimal54819bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal87cjbbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal6:12:33:11base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10TTT011T10T1Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101011000101100011011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000101000111011100000111
Bit length21 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits10within that length
Bit parityodd11 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes314 77 07
Gray code111100100110010000100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000101000111011100000111
64-bit0000000000000000000000000000000000000000000101000111011100000111
One's complement11111111111010111000100011111000at 32 bits, every bit flipped
Bits reversed11100000111011100010100000000000at 32 bits
Rotated left by 100000000001010001110111000001110at 32 bits, wrapping
Shifted left by 11010001110111000001110= 2,682,382, no wrap
Shifted right by 110100011101110000011= 670,595, discarding the low bit
These bits as a double6.62636398 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,341,191 to the power 21,798,793,298,481
1,341,191 to the power 32,412,525,382,783,030,871
1,341,191 to the power 43,235,657,330,660,155,956,907,361
1,341,191 to the power 54,339,634,490,965,425,228,000,540,406,951
First ten multiples1,341,191, 2,682,382, 4,023,573, 5,364,764, 6,705,955, 8,047,146, 9,388,337, 10,729,528, 12,070,719, 13,411,910
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 2
Divisible by 4No, remainder 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 5
Divisible by 8No, remainder 7
Divisible by 9No, remainder 2
Divisible by 10No, remainder 1
Divisible by 11No, remainder 5
Divisible by 12No, remainder 11
Divisible by 100No, remainder 91
Collatz (3n + 1) trajectory
Steps to reach 1137the total stopping time
Highest value reached9,053,0446× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,341,191 → 4,023,574 → 2,011,787 → 6,035,362 → 3,017,681 → 9,053,044 → 4,526,522 → 2,263,261 → 6,789,784 → 3,394,892 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage134,119,100%
1,341,191% as a decimal13,411.91
1,341,191% of 1001,341,191
1,341,191% of 1,00013,411,910
As a fraction of 1001,341,191/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,341,191
Nerdulate something else
Nothing in mind? Surprise me · today’s page