Recognised as Number
1,811,162
- Positive
- Even
- Composite
- 7 digits
1,811,162 is an even 7-digit integer and a composite number. It has 4 divisors and a digital root of 2.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,811,162
Digit count7
Digit sum20
Digit product96
Multiplicative persistence4times 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 factorisation2 × 905,581
Distinct prime factors22, 905,581
Number of divisors4
Sum of divisors σ(n)2,716,746
Aliquot sum905,584sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)905,580integers below n that share no factor with it
Carmichael function λ(n)905,580the 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, 905,581, 1,811,1624 in total
Arithmetic
Previous number1,811,161
Next number1,811,163
Double3,622,324
Half905,581
Square3,280,307,790,244
Cube5,941,168,817,993,903,528
Square root1,345.794189317≈irrational, shown to 9 decimal places
Cube root121.894964689≈
Negation-1,811,162
Reciprocal5.52131725 × 10^-7≈
Representations
Decimal1,811,162
Binary11011101000101101101021 bits
Octal6721332
Hexadecimal1BA2DA
Base 3612TI2
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, eight hundred and eleven thousand, one hundred and sixty-two
Ordinalone million, eight hundred and eleven thousand, one hundred and sixty-second
Scientific notation1.811162 × 10^6
Engineering notation1.811162 × 10^6
In other bases
Ternary10102000110002base 3; the most digit-efficient integer base after e: 14 digits
Quinary430424122base 5; one hand: 9 digits
Septenary21252233base 7: 8 digits
Nonary3360402base 9; each digit is two ternary digits: 7 digits
Duodecimal734162base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalb67i2base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal8:23:6:2base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1011T00011001Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11011001110011100101110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000110111010001011011010
Bit length21 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits9within that length
Bit parityeven12 set bits, so even; 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
Bytes31b a2 da
Gray code101100111001110110111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000110111010001011011010
64-bit0000000000000000000000000000000000000000000110111010001011011010
One's complement11111111111001000101110100100101at 32 bits, every bit flipped
Bits reversed01011011010001011101100000000000at 32 bits
Rotated left by 100000000001101110100010110110100at 32 bits, wrapping
Shifted left by 11101110100010110110100= 3,622,324, no wrap
Shifted right by 111011101000101101101= 905,581, discarding the low bit
These bits as a double8.94832923 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,811,162 to the power 23,280,307,790,244
1,811,162 to the power 35,941,168,817,993,903,528
1,811,162 to the power 410,760,419,198,735,474,301,579,536
1,811,162 to the power 519,488,862,356,820,139,106,997,395,580,832
First ten multiples1,811,162, 3,622,324, 5,433,486, 7,244,648, 9,055,810, 10,866,972, 12,678,134, 14,489,296, 16,300,458, 18,111,620
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 2
Divisible by 4No, remainder 2
Divisible by 5No, remainder 2
Divisible by 6No, remainder 2
Divisible by 7No, remainder 3
Divisible by 8No, remainder 2
Divisible by 9No, remainder 2
Divisible by 10No, remainder 2
Divisible by 11No, remainder 1
Divisible by 12No, remainder 2
Divisible by 100No, remainder 62
Collatz (3n + 1) trajectory
Steps to reach 1140the total stopping time
Highest value reached5,507,6563× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,811,162 → 905,581 → 2,716,744 → 1,358,372 → 679,186 → 339,593 → 1,018,780 → 509,390 → 254,695 → 764,086 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage181,116,200%
1,811,162% as a decimal18,111.62
1,811,162% of 1001,811,162
1,811,162% of 1,00018,111,620
As a fraction of 1001,811,162/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,811,162
Nerdulate something else
Nothing in mind? Surprise me · today’s page