Recognised as Number
1,049,033
- Positive
- Odd
- Composite
- 7 digits
1,049,033 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,049,033
Digit count7
Digit sum20
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times 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 factorisation139 × 7,547
Distinct prime factors2139, 7,547
Number of divisors4
Sum of divisors σ(n)1,056,720
Aliquot sum7,687sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,041,348integers below n that share no factor with it
Carmichael function λ(n)520,674the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,041,348
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 139, 7,547, 1,049,0334 in total
Arithmetic
Previous number1,049,032
Next number1,049,034
Double2,098,066
Half524,516.5
Square1,100,470,235,089
Cube1,154,429,592,126,118,937
Square root1,024.223120223≈irrational, shown to 9 decimal places
Cube root101.608424343≈
Negation-1,049,033
Reciprocal9.53258858 × 10^-7≈
Representations
Decimal1,049,033
Binary10000000000011100100121 bits
Octal4000711
Hexadecimal1001C9
Base 36MHFT
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, forty-nine thousand and thirty-three
Ordinalone million, forty-nine thousand and thirty-third
Scientific notation1.049033 × 10^6
Engineering notation1.049033 × 10^6
In other bases
Ternary1222022000002base 3; the most digit-efficient integer base after e: 13 digits
Quinary232032113base 5; one hand: 9 digits
Septenary11626256base 7: 8 digits
Nonary1868002base 9; each digit is two ternary digits: 7 digits
Duodecimal4270b5base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal6b2bdbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal4:51:23:53base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T00T10T00001Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100000000011011011001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100000000000111001001
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 odd
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes310 01 c9
Gray code110000000000100101101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100000000000111001001
64-bit0000000000000000000000000000000000000000000100000000000111001001
One's complement11111111111011111111111000110110at 32 bits, every bit flipped
Bits reversed10010011100000000000100000000000at 32 bits
Rotated left by 100000000001000000000001110010010at 32 bits, wrapping
Shifted left by 11000000000001110010010= 2,098,066, no wrap
Shifted right by 110000000000011100100= 524,516, discarding the low bit
These bits as a double5.18291167 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,049,033 to the power 21,100,470,235,089
1,049,033 to the power 31,154,429,592,126,118,937
1,049,033 to the power 41,211,034,738,316,838,926,837,921
1,049,033 to the power 51,270,415,404,640,728,489,937,564,780,393
First ten multiples1,049,033, 2,098,066, 3,147,099, 4,196,132, 5,245,165, 6,294,198, 7,343,231, 8,392,264, 9,441,297, 10,490,330
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 1
Divisible by 5No, remainder 3
Divisible by 6No, remainder 5
Divisible by 7No, remainder 6
Divisible by 8No, remainder 1
Divisible by 9No, remainder 2
Divisible by 10No, remainder 3
Divisible by 11No, remainder 7
Divisible by 12No, remainder 5
Divisible by 100No, remainder 33
Collatz (3n + 1) trajectory
Steps to reach 1103the total stopping time
Highest value reached5,310,7365× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,049,033 → 3,147,100 → 1,573,550 → 786,775 → 2,360,326 → 1,180,163 → 3,540,490 → 1,770,245 → 5,310,736 → 2,655,368 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage104,903,300%
1,049,033% as a decimal10,490.33
1,049,033% of 1001,049,033
1,049,033% of 1,00010,490,330
As a fraction of 1001,049,033/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,033
Nerdulate something else
Nothing in mind? Surprise me · today’s page