Recognised as Number
2,100,743
- Positive
- Odd
- Prime
- 7 digits
2,100,743 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,100,743
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 numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2,100,743
Distinct prime factors12,100,743
Number of divisors2
Sum of divisors σ(n)2,100,744
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,100,742integers below n that share no factor with it
Carmichael function λ(n)2,100,742the 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,100,7432 in total
Arithmetic
Previous number2,100,742
Next number2,100,744
Double4,201,486
Half1,050,371.5
Square4,413,121,152,049
Cube9,270,833,368,318,872,407
Square root1,449.394011303≈irrational, shown to 9 decimal places
Cube root128.073017421≈
Negation-2,100,743
Reciprocal4.76022055 × 10^-7≈
Representations
Decimal2,100,743
Binary100000000011100000011122 bits
Octal10007007
Hexadecimal200E07
Base 36190XZ
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, one hundred thousand, seven hundred and forty-three
Ordinaltwo million, one hundred thousand, seven hundred and forty-third
Scientific notation2.100743 × 10^6
Engineering notation2.100743 × 10^6
In other bases
Ternary10221201200022base 3; the most digit-efficient integer base after e: 14 digits
Quinary1014210433base 5; one hand: 10 digits
Septenary23566421base 7: 8 digits
Nonary3851608base 9; each digit is two ternary digits: 7 digits
Duodecimal85385bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimald2bh3base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal9:43:32:23base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1100TT1TT0010Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11000000001001000011011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001000000000111000000111
Bit length22 bitsto write the magnitude
Set bits7the population count, or Hamming weight
Zero bits15within that length
Bit parityodd7 set bits, so odd; 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 0e 07
Gray code1100000000100100000100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001000000000111000000111
64-bit0000000000000000000000000000000000000000001000000000111000000111
One's complement11111111110111111111000111111000at 32 bits, every bit flipped
Bits reversed11100000011100000000010000000000at 32 bits
Rotated left by 100000000010000000001110000001110at 32 bits, wrapping
Shifted left by 110000000001110000001110= 4,201,486, no wrap
Shifted right by 1100000000011100000011= 1,050,371, discarding the low bit
These bits as a double1.03790495 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,100,743 to the power 24,413,121,152,049
2,100,743 to the power 39,270,833,368,318,872,407
2,100,743 to the power 419,475,638,302,662,292,976,898,401
2,100,743 to the power 540,913,310,834,849,693,335,168,477,611,943
First ten multiples2,100,743, 4,201,486, 6,302,229, 8,402,972, 10,503,715, 12,604,458, 14,705,201, 16,805,944, 18,906,687, 21,007,430
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 3
Divisible by 6No, remainder 5
Divisible by 7No, remainder 1
Divisible by 8No, remainder 7
Divisible by 9No, remainder 8
Divisible by 10No, remainder 3
Divisible by 11No, remainder 7
Divisible by 12No, remainder 11
Divisible by 100No, remainder 43
Collatz (3n + 1) trajectory
Steps to reach 1228the total stopping time
Highest value reached38,329,36018× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,100,743 → 6,302,230 → 3,151,115 → 9,453,346 → 4,726,673 → 14,180,020 → 7,090,010 → 3,545,005 → 10,635,016 → 5,317,508 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage210,074,300%
2,100,743% as a decimal21,007.43
2,100,743% of 1002,100,743
2,100,743% of 1,00021,007,430
As a fraction of 1002,100,743/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,100,743
Nerdulate something else
Nothing in mind? Surprise me · today’s page