Recognised as Number
1,341,189
- Positive
- Odd
- Composite
- 7 digits
1,341,189 is an odd 7-digit integer and a composite number. It has 6 divisors and a digital root of 9.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,341,189
Digit count7
Digit sum27
Digit product864
Multiplicative persistence4times 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 factorisation3^2 × 149,021
Distinct prime factors23, 149,021
Number of divisors6
Sum of divisors σ(n)1,937,286
Aliquot sum596,097sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)894,120integers below n that share no factor with it
Carmichael function λ(n)447,060the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 894,120
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 3, 9, 149,021, 447,063, 1,341,1896 in total
Arithmetic
Previous number1,341,188
Next number1,341,190
Double2,682,378
Half670,594.5
Square1,798,787,933,721
Cube2,412,514,590,039,334,269
Square root1,158.097146184≈irrational, shown to 9 decimal places
Cube root110.279975498≈
Negation-1,341,189
Reciprocal7.4560707 × 10^-7≈
Representations
Decimal1,341,189
Binary10100011101110000010121 bits
Octal5073405
Hexadecimal147705
Base 36SQV9
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, three hundred and forty-one thousand, one hundred and eighty-nine
Ordinalone million, three hundred and forty-one thousand, one hundred and eighty-ninth
Scientific notation1.341189 × 10^6
Engineering notation1.341189 × 10^6
In other bases
Ternary2112010202200base 3; the most digit-efficient integer base after e: 13 digits
Quinary320404224base 5; one hand: 9 digits
Septenary14254113base 7: 8 digits
Nonary2463680base 9; each digit is two ternary digits: 7 digits
Duodecimal548199base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal87cj9base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal6:12:33:9base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10TTT011T10T00digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101011000101100000101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000101000111011100000101
Bit length21 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits11within that length
Bit parityeven10 set bits, so even; 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 05
Gray code111100100110010000111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000101000111011100000101
64-bit0000000000000000000000000000000000000000000101000111011100000101
One's complement11111111111010111000100011111010at 32 bits, every bit flipped
Bits reversed10100000111011100010100000000000at 32 bits
Rotated left by 100000000001010001110111000001010at 32 bits, wrapping
Shifted left by 11010001110111000001010= 2,682,378, no wrap
Shifted right by 110100011101110000010= 670,594, discarding the low bit
These bits as a double6.62635409 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,341,189 to the power 21,798,787,933,721
1,341,189 to the power 32,412,514,590,039,334,269
1,341,189 to the power 43,235,638,030,500,264,688,905,841
1,341,189 to the power 54,339,602,134,488,619,497,848,935,984,949
First ten multiples1,341,189, 2,682,378, 4,023,567, 5,364,756, 6,705,945, 8,047,134, 9,388,323, 10,729,512, 12,070,701, 13,411,890
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 1
Divisible by 5No, remainder 4
Divisible by 6No, remainder 3
Divisible by 7No, remainder 3
Divisible by 8No, remainder 5
Divisible by 9Yes
Divisible by 10No, remainder 9
Divisible by 11No, remainder 3
Divisible by 12No, remainder 9
Divisible by 100No, remainder 89
Collatz (3n + 1) trajectory
Steps to reach 1137the total stopping time
Highest value reached4,023,5683× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,341,189 → 4,023,568 → 2,011,784 → 1,005,892 → 502,946 → 251,473 → 754,420 → 377,210 → 188,605 → 565,816 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage134,118,900%
1,341,189% as a decimal13,411.89
1,341,189% of 1001,341,189
1,341,189% of 1,00013,411,890
As a fraction of 1001,341,189/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,189
Nerdulate something else
Nothing in mind? Surprise me · today’s page