Recognised as Number
2,181,071
- Positive
- Odd
- Prime
- 7 digits
2,181,071 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value2,181,071
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 factorisation2,181,071
Distinct prime factors12,181,071
Number of divisors2
Sum of divisors σ(n)2,181,072
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,181,070integers below n that share no factor with it
Carmichael function λ(n)2,181,070the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)−11 distinct prime factor, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 2,181,0712 in total
Arithmetic
Previous number2,181,070
Next number2,181,072
Double4,362,142
Half1,090,535.5
Square4,757,070,707,041
Cube10,375,508,964,076,620,911
Square root1,476.844947853≈irrational, shown to 9 decimal places
Cube root129.685056159≈
Negation-2,181,071
Reciprocal4.58490347 × 10^-7≈
Representations
Decimal2,181,071
Binary100001010001111100111122 bits
Octal10243717
Hexadecimal2147CF
Base 361AQXB
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, one hundred and eighty-one thousand and seventy-one
Ordinaltwo million, one hundred and eighty-one thousand and seventy-first
Scientific notation2.181071 × 10^6
Engineering notation2.181071 × 10^6
In other bases
Ternary11002210212102base 3; the most digit-efficient integer base after e: 14 digits
Quinary1024243241base 5; one hand: 10 digits
Septenary24352544base 7: 8 digits
Nonary4083772base 9; each digit is two ternary digits: 7 digits
Duodecimal89223bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimaldccdbbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal10:5:51:11base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary11010T110TT11Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11000010101100011010011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001000010100011111001111
Bit length22 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits10within that length
Bit parityeven12 set bits, so even; not the same as the number itself being odd
Highest set bitbit 21worth 2,097,152
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes321 47 cf
Gray code1100011110010000101000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001000010100011111001111
64-bit0000000000000000000000000000000000000000001000010100011111001111
One's complement11111111110111101011100000110000at 32 bits, every bit flipped
Bits reversed11110011111000101000010000000000at 32 bits
Rotated left by 100000000010000101000111110011110at 32 bits, wrapping
Shifted left by 110000101000111110011110= 4,362,142, no wrap
Shifted right by 1100001010001111100111= 1,090,535, discarding the low bit
These bits as a double1.07759225 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,181,071 to the power 24,757,070,707,041
2,181,071 to the power 310,375,508,964,076,620,911
2,181,071 to the power 422,629,721,711,787,559,646,975,681
2,181,071 to the power 549,357,029,763,650,204,506,788,895,534,351
First ten multiples2,181,071, 4,362,142, 6,543,213, 8,724,284, 10,905,355, 13,086,426, 15,267,497, 17,448,568, 19,629,639, 21,810,710
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 2
Divisible by 4No, remainder 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 4
Divisible by 8No, remainder 7
Divisible by 9No, remainder 2
Divisible by 10No, remainder 1
Divisible by 11No, remainder 2
Divisible by 12No, remainder 11
Divisible by 100No, remainder 71
Collatz (3n + 1) trajectory
Steps to reach 1148the total stopping time
Highest value reached22,083,35210× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,181,071 → 6,543,214 → 3,271,607 → 9,814,822 → 4,907,411 → 14,722,234 → 7,361,117 → 22,083,352 → 11,041,676 → 5,520,838 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage218,107,100%
2,181,071% as a decimal21,810.71
2,181,071% of 1002,181,071
2,181,071% of 1,00021,810,710
As a fraction of 1002,181,071/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,181,071
Nerdulate something else
Nothing in mind? Surprise me · today’s page