Recognised as Number
1,048,882
- Positive
- Even
- Composite
- 7 digits
1,048,882 is an even 7-digit integer and a composite number. It has 8 divisors and a digital root of 4.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,048,882
Digit count7
Digit sum31
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 factorisation2 × 467 × 1,123
Distinct prime factors32, 467, 1,123
Number of divisors8
Sum of divisors σ(n)1,578,096
Aliquot sum529,214sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)522,852integers below n that share no factor with it
Carmichael function λ(n)261,426the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 522,852
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 467, 934, 1,123, 2,246, 524,441, 1,048,8828 in total
Arithmetic
Previous number1,048,881
Next number1,048,883
Double2,097,764
Half524,441
Square1,100,153,449,924
Cube1,153,931,150,863,184,968
Square root1,024.149403163≈irrational, shown to 9 decimal places
Cube root101.603548866≈
Negation-1,048,882
Reciprocal9.53396092 × 10^-7≈
Representations
Decimal1,048,882
Binary10000000000010011001021 bits
Octal4000462
Hexadecimal100132
Base 36MHBM
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, forty-eight thousand, eight hundred and eighty-two
Ordinalone million, forty-eight thousand, eight hundred and eighty-second
Scientific notation1.048882 × 10^6
Engineering notation1.048882 × 10^6
In other bases
Ternary1222021210111base 3; the most digit-efficient integer base after e: 13 digits
Quinary232031012base 5; one hand: 9 digits
Septenary11625652base 7: 8 digits
Nonary1867714base 9; each digit is two ternary digits: 7 digits
Duodecimal426baabase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal6b242base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal4:51:21:22base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T00T10TT10111digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100000000000101110110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100000000000100110010
Bit length21 bitsto write the magnitude
Set bits5the population count, or Hamming weight
Zero bits16within that length
Bit parityodd5 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 32
Gray code110000000000110101011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100000000000100110010
64-bit0000000000000000000000000000000000000000000100000000000100110010
One's complement11111111111011111111111011001101at 32 bits, every bit flipped
Bits reversed01001100100000000000100000000000at 32 bits
Rotated left by 100000000001000000000001001100100at 32 bits, wrapping
Shifted left by 11000000000001001100100= 2,097,764, no wrap
Shifted right by 110000000000010011001= 524,441, discarding the low bit
These bits as a double5.18216563 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,048,882 to the power 21,100,153,449,924
1,048,882 to the power 31,153,931,150,863,184,968
1,048,882 to the power 41,210,337,613,379,679,175,605,776
1,048,882 to the power 51,269,501,336,596,904,653,067,737,542,432
First ten multiples1,048,882, 2,097,764, 3,146,646, 4,195,528, 5,244,410, 6,293,292, 7,342,174, 8,391,056, 9,439,938, 10,488,820
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 2
Divisible by 6No, remainder 4
Divisible by 7No, remainder 2
Divisible by 8No, remainder 2
Divisible by 9No, remainder 4
Divisible by 10No, remainder 2
Divisible by 11No, remainder 10
Divisible by 12No, remainder 10
Divisible by 100No, remainder 82
Collatz (3n + 1) trajectory
Steps to reach 1227the total stopping time
Highest value reached1,769,9921× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,048,882 → 524,441 → 1,573,324 → 786,662 → 393,331 → 1,179,994 → 589,997 → 1,769,992 → 884,996 → 442,498 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage104,888,200%
1,048,882% as a decimal10,488.82
1,048,882% of 1001,048,882
1,048,882% of 1,00010,488,820
As a fraction of 1001,048,882/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,048,882
Nerdulate something else
Nothing in mind? Surprise me · today’s page