Recognised as Number
1,082,813
- Positive
- Odd
- Composite
- 7 digits
1,082,813 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 5.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,082,813
Digit count7
Digit sum23
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation241 × 4,493
Distinct prime factors2241, 4,493
Number of divisors4
Sum of divisors σ(n)1,087,548
Aliquot sum4,735sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,078,080integers below n that share no factor with it
Carmichael function λ(n)269,520the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,078,080
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 241, 4,493, 1,082,8134 in total
Arithmetic
Previous number1,082,812
Next number1,082,814
Double2,165,626
Half541,406.5
Square1,172,483,992,969
Cube1,269,580,909,878,741,797
Square root1,040.583009663≈irrational, shown to 9 decimal places
Cube root102.687556655≈
Negation-1,082,813
Reciprocal9.23520497 × 10^-7≈
Representations
Decimal1,082,813
Binary10000100001011011110121 bits
Octal4102675
Hexadecimal1085BD
Base 36N7I5
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, eighty-two thousand, eight hundred and thirteen
Ordinalone million, eighty-two thousand, eight hundred and thirteenth
Scientific notation1.082813 × 10^6
Engineering notation1.082813 × 10^6
In other bases
Ternary2001000100012base 3; the most digit-efficient integer base after e: 13 digits
Quinary234122223base 5; one hand: 9 digits
Septenary12126614base 7: 8 digits
Nonary2030305base 9; each digit is two ternary digits: 7 digits
Duodecimal442765base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal6f70dbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal5:0:46:53base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0010001001TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100011001101011001101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100001000010110111101
Bit length21 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits11within that length
Bit parityeven10 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 85 bd
Gray code110001100011101100011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100001000010110111101
64-bit0000000000000000000000000000000000000000000100001000010110111101
One's complement11111111111011110111101001000010at 32 bits, every bit flipped
Bits reversed10111101101000010000100000000000at 32 bits
Rotated left by 100000000001000010000101101111010at 32 bits, wrapping
Shifted left by 11000010000101101111010= 2,165,626, no wrap
Shifted right by 110000100001011011110= 541,406, discarding the low bit
These bits as a double5.34980704 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,082,813 to the power 21,172,483,992,969
1,082,813 to the power 31,269,580,909,878,741,797
1,082,813 to the power 41,374,718,713,768,530,041,434,961
1,082,813 to the power 51,488,563,294,611,843,319,756,314,425,293
First ten multiples1,082,813, 2,165,626, 3,248,439, 4,331,252, 5,414,065, 6,496,878, 7,579,691, 8,662,504, 9,745,317, 10,828,130
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 4
Divisible by 8No, remainder 5
Divisible by 9No, remainder 5
Divisible by 10No, remainder 3
Divisible by 11No, remainder 6
Divisible by 12No, remainder 5
Divisible by 100No, remainder 13
Collatz (3n + 1) trajectory
Steps to reach 1165the total stopping time
Highest value reached3,248,4403× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,082,813 → 3,248,440 → 1,624,220 → 812,110 → 406,055 → 1,218,166 → 609,083 → 1,827,250 → 913,625 → 2,740,876 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage108,281,300%
1,082,813% as a decimal10,828.13
1,082,813% of 1001,082,813
1,082,813% of 1,00010,828,130
As a fraction of 1001,082,813/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,082,813
Nerdulate something else
Nothing in mind? Surprise me · today’s page