Recognised as Number
2,011,683
- Positive
- Odd
- Composite
- 7 digits
2,011,683 is an odd 7-digit integer and a composite number. It has 16 divisors and a digital root of 3.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value2,011,683
Digit count7
Digit sum21
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root3repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3 × 31 × 97 × 223
Distinct prime factors43, 31, 97, 223
Number of divisors16
Sum of divisors σ(n)2,809,856
Aliquot sum798,173sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,278,720integers below n that share no factor with it
Carmichael function λ(n)17,760the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,278,720
Möbius function μ(n)+14 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 3, 31, 93, 97, 223, 291, 669, 3,007, 6,913, 9,021, 20,739, 21,631, 64,893, 670,561, 2,011,68316 in total
Arithmetic
Previous number2,011,682
Next number2,011,684
Double4,023,366
Half1,005,841.5
Square4,046,868,492,489
Cube8,141,016,549,575,748,987
Square root1,418.338112017≈irrational, shown to 9 decimal places
Cube root126.236956467≈
Negation-2,011,683
Reciprocal4.97096212 × 10^-7≈
Representations
Decimal2,011,683
Binary11110101100100010001121 bits
Octal7531043
Hexadecimal1EB223
Base 3617483
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, eleven thousand, six hundred and eighty-three
Ordinaltwo million, eleven thousand, six hundred and eighty-third
Scientific notation2.011683 × 10^6
Engineering notation2.011683 × 10^6
In other bases
Ternary10210012111210base 3; the most digit-efficient integer base after e: 14 digits
Quinary1003333213base 5; one hand: 10 digits
Septenary23045652base 7: 8 digits
Nonary3705453base 9; each digit is two ternary digits: 7 digits
Duodecimal810203base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalcb943base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal9:18:48:3base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary11T101T0TTTT10digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11000111111011001100111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000111101011001000100011
Bit length21 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits10within that length
Bit parityodd11 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
Bytes31e b2 23
Gray code100011110101100110010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000111101011001000100011
64-bit0000000000000000000000000000000000000000000111101011001000100011
One's complement11111111111000010100110111011100at 32 bits, every bit flipped
Bits reversed11000100010011010111100000000000at 32 bits
Rotated left by 100000000001111010110010001000110at 32 bits, wrapping
Shifted left by 11111010110010001000110= 4,023,366, no wrap
Shifted right by 111110101100100010001= 1,005,841, discarding the low bit
These bits as a double9.93903461 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,011,683 to the power 24,046,868,492,489
2,011,683 to the power 38,141,016,549,575,748,987
2,011,683 to the power 416,377,144,595,500,191,449,415,121
2,011,683 to the power 532,945,623,371,309,611,635,533,758,858,643
First ten multiples2,011,683, 4,023,366, 6,035,049, 8,046,732, 10,058,415, 12,070,098, 14,081,781, 16,093,464, 18,105,147, 20,116,830
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 3
Divisible by 5No, remainder 3
Divisible by 6No, remainder 3
Divisible by 7No, remainder 2
Divisible by 8No, remainder 3
Divisible by 9No, remainder 3
Divisible by 10No, remainder 3
Divisible by 11No, remainder 3
Divisible by 12No, remainder 3
Divisible by 100No, remainder 83
Collatz (3n + 1) trajectory
Steps to reach 191the total stopping time
Highest value reached9,052,5764× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,011,683 → 6,035,050 → 3,017,525 → 9,052,576 → 4,526,288 → 2,263,144 → 1,131,572 → 565,786 → 282,893 → 848,680 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage201,168,300%
2,011,683% as a decimal20,116.83
2,011,683% of 1002,011,683
2,011,683% of 1,00020,116,830
As a fraction of 1002,011,683/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 2,011,683
Nerdulate something else
Nothing in mind? Surprise me · today’s page