Recognised as Number
1,049,442
- Positive
- Even
- Composite
- 7 digits
1,049,442 is an even 7-digit integer and a composite number. It has 8 divisors and a digital root of 6.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,049,442
Digit count7
Digit sum24
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root6repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2 × 3 × 174,907
Distinct prime factors32, 3, 174,907
Number of divisors8
Sum of divisors σ(n)2,098,896
Aliquot sum1,049,454sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)349,812integers below n that share no factor with it
Carmichael function λ(n)174,906the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 349,812
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 3, 6, 174,907, 349,814, 524,721, 1,049,4428 in total
Arithmetic
Previous number1,049,441
Next number1,049,443
Double2,098,884
Half524,721
Square1,101,328,511,364
Cube1,155,780,395,622,858,888
Square root1,024.422764292≈irrational, shown to 9 decimal places
Cube root101.621627756≈
Negation-1,049,442
Reciprocal9.52887344 × 10^-7≈
Representations
Decimal1,049,442
Binary10000000000110110001021 bits
Octal4001542
Hexadecimal100362
Base 36MHR6
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, forty-nine thousand, four hundred and forty-two
Ordinalone million, forty-nine thousand, four hundred and forty-second
Scientific notation1.049442 × 10^6
Engineering notation1.049442 × 10^6
In other bases
Ternary1222022120020base 3; the most digit-efficient integer base after e: 13 digits
Quinary232040232base 5; one hand: 9 digits
Septenary11630412base 7: 8 digits
Nonary1868506base 9; each digit is two ternary digits: 7 digits
Duodecimal427396base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal6b3c2base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal4:51:30:42base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T00T100TT01T0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100000000010010100110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100000000001101100010
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
Bytes310 03 62
Gray code110000000001011010011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100000000001101100010
64-bit0000000000000000000000000000000000000000000100000000001101100010
One's complement11111111111011111111110010011101at 32 bits, every bit flipped
Bits reversed01000110110000000000100000000000at 32 bits
Rotated left by 100000000001000000000011011000100at 32 bits, wrapping
Shifted left by 11000000000011011000100= 2,098,884, no wrap
Shifted right by 110000000000110110001= 524,721, discarding the low bit
These bits as a double5.1849324 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,049,442 to the power 21,101,328,511,364
1,049,442 to the power 31,155,780,395,622,858,888
1,049,442 to the power 41,212,924,489,943,244,277,140,496
1,049,442 to the power 51,272,893,902,575,018,160,690,876,403,232
First ten multiples1,049,442, 2,098,884, 3,148,326, 4,197,768, 5,247,210, 6,296,652, 7,346,094, 8,395,536, 9,444,978, 10,494,420
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 2
Divisible by 6Yes
Divisible by 7No, remainder 2
Divisible by 8No, remainder 2
Divisible by 9No, remainder 6
Divisible by 10No, remainder 2
Divisible by 11No, remainder 9
Divisible by 12No, remainder 6
Divisible by 100No, remainder 42
Collatz (3n + 1) trajectory
Steps to reach 159the total stopping time
Highest value reached1,574,1641× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,049,442 → 524,721 → 1,574,164 → 787,082 → 393,541 → 1,180,624 → 590,312 → 295,156 → 147,578 → 73,789 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage104,944,200%
1,049,442% as a decimal10,494.42
1,049,442% of 1001,049,442
1,049,442% of 1,00010,494,420
As a fraction of 1001,049,442/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,049,442
Nerdulate something else
Nothing in mind? Surprise me · today’s page