Recognised as Number
2,102,273
- Positive
- Odd
- Prime
- 7 digits
2,102,273 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 8.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value2,102,273
Digit count7
Digit sum17
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2,102,273
Distinct prime factors12,102,273
Number of divisors2
Sum of divisors σ(n)2,102,274
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,102,272integers below n that share no factor with it
Carmichael function λ(n)2,102,272the 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,102,2732 in total
Arithmetic
Previous number2,102,272
Next number2,102,274
Double4,204,546
Half1,051,136.5
Square4,419,551,766,529
Cube9,291,104,350,876,220,417
Square root1,449.921722025≈irrational, shown to 9 decimal places
Cube root128.104102322≈
Negation-2,102,273
Reciprocal4.75675614 × 10^-7≈
Representations
Decimal2,102,273
Binary100000000101000000000122 bits
Octal10012001
Hexadecimal201401
Base 361924H
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, one hundred and two thousand, two hundred and seventy-three
Ordinaltwo million, one hundred and two thousand, two hundred and seventy-third
Scientific notation2.102273 × 10^6
Engineering notation2.102273 × 10^6
In other bases
Ternary10221210202222base 3; the most digit-efficient integer base after e: 14 digits
Quinary1014233043base 5; one hand: 10 digits
Septenary23604035base 7: 8 digits
Nonary3853688base 9; each digit is two ternary digits: 7 digits
Duodecimal854715base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimald2fddbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal9:43:57:53base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1100TT11T1000Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11000000001010000000001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001000000001010000000001
Bit length22 bitsto write the magnitude
Set bits4the population count, or Hamming weight
Zero bits18within that length
Bit parityeven4 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
Bytes320 14 01
Gray code1100000001111000000001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001000000001010000000001
64-bit0000000000000000000000000000000000000000001000000001010000000001
One's complement11111111110111111110101111111110at 32 bits, every bit flipped
Bits reversed10000000001010000000010000000000at 32 bits
Rotated left by 100000000010000000010100000000010at 32 bits, wrapping
Shifted left by 110000000010100000000010= 4,204,546, no wrap
Shifted right by 1100000000101000000000= 1,051,136, discarding the low bit
These bits as a double1.03866087 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,102,273 to the power 24,419,551,766,529
2,102,273 to the power 39,291,104,350,876,220,417
2,102,273 to the power 419,532,437,817,029,604,524,707,841
2,102,273 to the power 541,062,516,646,920,277,792,971,127,022,593
First ten multiples2,102,273, 4,204,546, 6,306,819, 8,409,092, 10,511,365, 12,613,638, 14,715,911, 16,818,184, 18,920,457, 21,022,730
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 1
Divisible by 5No, remainder 3
Divisible by 6No, remainder 5
Divisible by 7No, remainder 5
Divisible by 8No, remainder 1
Divisible by 9No, remainder 8
Divisible by 10No, remainder 3
Divisible by 11No, remainder 8
Divisible by 12No, remainder 5
Divisible by 100No, remainder 73
Collatz (3n + 1) trajectory
Steps to reach 1166the total stopping time
Highest value reached6,306,8203× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,102,273 → 6,306,820 → 3,153,410 → 1,576,705 → 4,730,116 → 2,365,058 → 1,182,529 → 3,547,588 → 1,773,794 → 886,897 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage210,227,300%
2,102,273% as a decimal21,022.73
2,102,273% of 1002,102,273
2,102,273% of 1,00021,022,730
As a fraction of 1002,102,273/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,102,273
Nerdulate something else
Nothing in mind? Surprise me · today’s page