Recognised as Number
1,083,521
- Positive
- Odd
- Composite
- 7 digits
1,083,521 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,083,521
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 factorisation769 × 1,409
Distinct prime factors2769, 1,409
Number of divisors4
Sum of divisors σ(n)1,085,700
Aliquot sum2,179sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,081,344integers below n that share no factor with it
Carmichael function λ(n)8,448the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,081,344
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 769, 1,409, 1,083,5214 in total
Arithmetic
Previous number1,083,520
Next number1,083,522
Double2,167,042
Half541,760.5
Square1,174,017,757,441
Cube1,272,072,894,560,229,761
Square root1,040.92314798≈irrational, shown to 9 decimal places
Cube root102.709932618≈
Negation-1,083,521
Reciprocal9.22917045 × 10^-7≈
Representations
Decimal1,083,521
Binary10000100010001000000121 bits
Octal4104201
Hexadecimal108881
Base 36N81T
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, eighty-three thousand, five hundred and twenty-one
Ordinalone million, eighty-three thousand, five hundred and twenty-first
Scientific notation1.083521 × 10^6
Engineering notation1.083521 × 10^6
In other bases
Ternary2001001022102base 3; the most digit-efficient integer base after e: 13 digits
Quinary234133041base 5; one hand: 9 digits
Septenary12131645base 7: 8 digits
Nonary2031272base 9; each digit is two ternary digits: 7 digits
Duodecimal443055base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal6f8g1base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal5:0:58:41base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T00100110T11Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100011001100110000001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100001000100010000001
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 odd
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes310 88 81
Gray code110001100110011000001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100001000100010000001
64-bit0000000000000000000000000000000000000000000100001000100010000001
One's complement11111111111011110111011101111110at 32 bits, every bit flipped
Bits reversed10000001000100010000100000000000at 32 bits
Rotated left by 100000000001000010001000100000010at 32 bits, wrapping
Shifted left by 11000010001000100000010= 2,167,042, no wrap
Shifted right by 110000100010001000000= 541,760, discarding the low bit
These bits as a double5.35330503 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,083,521 to the power 21,174,017,757,441
1,083,521 to the power 31,272,072,894,560,229,761
1,083,521 to the power 41,378,317,694,786,794,710,868,481
1,083,521 to the power 51,493,436,166,973,082,591,914,927,401,601
First ten multiples1,083,521, 2,167,042, 3,250,563, 4,334,084, 5,417,605, 6,501,126, 7,584,647, 8,668,168, 9,751,689, 10,835,210
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 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 5
Divisible by 8No, remainder 1
Divisible by 9No, remainder 2
Divisible by 10No, remainder 1
Divisible by 11No, remainder 10
Divisible by 12No, remainder 5
Divisible by 100No, remainder 21
Collatz (3n + 1) trajectory
Steps to reach 1209the total stopping time
Highest value reached3,250,5643× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,083,521 → 3,250,564 → 1,625,282 → 812,641 → 2,437,924 → 1,218,962 → 609,481 → 1,828,444 → 914,222 → 457,111 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage108,352,100%
1,083,521% as a decimal10,835.21
1,083,521% of 1001,083,521
1,083,521% of 1,00010,835,210
As a fraction of 1001,083,521/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,083,521
Nerdulate something else
Nothing in mind? Surprise me · today’s page