Recognised as Number
1,341,049
- Positive
- Odd
- Composite
- 7 digits
1,341,049 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,341,049
Digit count7
Digit sum22
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation461 × 2,909
Distinct prime factors2461, 2,909
Number of divisors4
Sum of divisors σ(n)1,344,420
Aliquot sum3,371sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,337,680integers below n that share no factor with it
Carmichael function λ(n)334,420the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,337,680
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 461, 2,909, 1,341,0494 in total
Arithmetic
Previous number1,341,048
Next number1,341,050
Double2,682,098
Half670,524.5
Square1,798,412,420,401
Cube2,411,759,177,966,340,649
Square root1,158.036700627≈irrational, shown to 9 decimal places
Cube root110.276138173≈
Negation-1,341,049
Reciprocal7.45684908 × 10^-7≈
Representations
Decimal1,341,049
Binary10100011101100111100121 bits
Octal5073171
Hexadecimal147679
Base 36SQRD
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, three hundred and forty-one thousand and forty-nine
Ordinalone million, three hundred and forty-one thousand and forty-ninth
Scientific notation1.341049 × 10^6
Engineering notation1.341049 × 10^6
In other bases
Ternary2112010120111base 3; the most digit-efficient integer base after e: 13 digits
Quinary320403144base 5; one hand: 9 digits
Septenary14253523base 7: 8 digits
Nonary2463514base 9; each digit is two ternary digits: 7 digits
Duodecimal5480a1base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal87cc9base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal6:12:30:49base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10TTT011TT0111digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101011000101110001001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000101000111011001111001
Bit length21 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits9within that length
Bit parityeven12 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 76 79
Gray code111100100110101000101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000101000111011001111001
64-bit0000000000000000000000000000000000000000000101000111011001111001
One's complement11111111111010111000100110000110at 32 bits, every bit flipped
Bits reversed10011110011011100010100000000000at 32 bits
Rotated left by 100000000001010001110110011110010at 32 bits, wrapping
Shifted left by 11010001110110011110010= 2,682,098, no wrap
Shifted right by 110100011101100111100= 670,524, discarding the low bit
These bits as a double6.6256624 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,341,049 to the power 21,798,412,420,401
1,341,049 to the power 32,411,759,177,966,340,649
1,341,049 to the power 43,234,287,233,852,583,161,000,801
1,341,049 to the power 54,337,337,660,670,772,795,476,963,180,249
First ten multiples1,341,049, 2,682,098, 4,023,147, 5,364,196, 6,705,245, 8,046,294, 9,387,343, 10,728,392, 12,069,441, 13,410,490
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 1
Divisible by 4No, remainder 1
Divisible by 5No, remainder 4
Divisible by 6No, remainder 1
Divisible by 7No, remainder 3
Divisible by 8No, remainder 1
Divisible by 9No, remainder 4
Divisible by 10No, remainder 9
Divisible by 11No, remainder 6
Divisible by 12No, remainder 1
Divisible by 100No, remainder 49
Collatz (3n + 1) trajectory
Steps to reach 1186the total stopping time
Highest value reached11,612,9688× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,341,049 → 4,023,148 → 2,011,574 → 1,005,787 → 3,017,362 → 1,508,681 → 4,526,044 → 2,263,022 → 1,131,511 → 3,394,534 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage134,104,900%
1,341,049% as a decimal13,410.49
1,341,049% of 1001,341,049
1,341,049% of 1,00013,410,490
As a fraction of 1001,341,049/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,049
Nerdulate something else
Nothing in mind? Surprise me · today’s page