Recognised as Number
1,049,038
- Positive
- Even
- Composite
- 7 digits
1,049,038 is an even 7-digit integer and a composite number. It has 4 divisors and a digital root of 7.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,049,038
Digit count7
Digit sum25
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2 × 524,519
Distinct prime factors22, 524,519
Number of divisors4
Sum of divisors σ(n)1,573,560
Aliquot sum524,522sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)524,518integers below n that share no factor with it
Carmichael function λ(n)524,518the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 524,519, 1,049,0384 in total
Arithmetic
Previous number1,049,037
Next number1,049,039
Double2,098,076
Half524,519
Square1,100,480,725,444
Cube1,154,446,099,258,322,872
Square root1,024.225561095≈irrational, shown to 9 decimal places
Cube root101.608585775≈
Negation-1,049,038
Reciprocal9.53254315 × 10^-7≈
Representations
Decimal1,049,038
Binary10000000000011100111021 bits
Octal4000716
Hexadecimal1001CE
Base 36MHFY
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, forty-nine thousand and thirty-eight
Ordinalone million, forty-nine thousand and thirty-eighth
Scientific notation1.049038 × 10^6
Engineering notation1.049038 × 10^6
In other bases
Ternary1222022000021base 3; the most digit-efficient integer base after e: 13 digits
Quinary232032123base 5; one hand: 9 digits
Septenary11626264base 7: 8 digits
Nonary1868007base 9; each digit is two ternary digits: 7 digits
Duodecimal4270babase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal6b2bibase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal4:51:23:58base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T00T10T0001T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100000000011011010010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100000000000111001110
Bit length21 bitsto write the magnitude
Set bits7the population count, or Hamming weight
Zero bits14within that length
Bit parityodd7 set bits, so odd; 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 01 ce
Gray code110000000000100101001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100000000000111001110
64-bit0000000000000000000000000000000000000000000100000000000111001110
One's complement11111111111011111111111000110001at 32 bits, every bit flipped
Bits reversed01110011100000000000100000000000at 32 bits
Rotated left by 100000000001000000000001110011100at 32 bits, wrapping
Shifted left by 11000000000001110011100= 2,098,076, no wrap
Shifted right by 110000000000011100111= 524,519, discarding the low bit
These bits as a double5.18293637 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,049,038 to the power 21,100,480,725,444
1,049,038 to the power 31,154,446,099,258,322,872
1,049,038 to the power 41,211,057,827,073,752,508,997,136
1,049,038 to the power 51,270,445,680,797,795,184,533,337,555,168
First ten multiples1,049,038, 2,098,076, 3,147,114, 4,196,152, 5,245,190, 6,294,228, 7,343,266, 8,392,304, 9,441,342, 10,490,380
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 1
Divisible by 4No, remainder 2
Divisible by 5No, remainder 3
Divisible by 6No, remainder 4
Divisible by 7No, remainder 4
Divisible by 8No, remainder 6
Divisible by 9No, remainder 7
Divisible by 10No, remainder 8
Divisible by 11No, remainder 1
Divisible by 12No, remainder 10
Divisible by 100No, remainder 38
Collatz (3n + 1) trajectory
Steps to reach 1103the total stopping time
Highest value reached5,974,6125× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,049,038 → 524,519 → 1,573,558 → 786,779 → 2,360,338 → 1,180,169 → 3,540,508 → 1,770,254 → 885,127 → 2,655,382 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage104,903,800%
1,049,038% as a decimal10,490.38
1,049,038% of 1001,049,038
1,049,038% of 1,00010,490,380
As a fraction of 1001,049,038/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,038
Nerdulate something else
Nothing in mind? Surprise me · today’s page