Recognised as Number

2,100,765

Positive
Odd
Composite
7 digits

2,100,765 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,100,765

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 × 5 × 43 × 3,257

Distinct prime factors43, 5, 43, 3,257

Number of divisors16

Sum of divisors σ(n)3,440,448

Aliquot sum1,339,683sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)1,094,016integers below n that share no factor with it

Carmichael function λ(n)68,376the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,094,016

Möbius function μ(n)+14 distinct prime factors, an even number of them

SquarefreeYesno repeated prime factor

All divisors1, 3, 5, 15, 43, 129, 215, 645, 3,257, 9,771, 16,285, 48,855, 140,051, 420,153, 700,255, 2,100,76516 in total

Arithmetic

Previous number2,100,764

Next number2,100,766

Double4,201,530

Half1,050,382.5

Square4,413,213,585,225

Cube9,271,124,637,365,197,125

Square root1,449.401600661≈irrational, shown to 9 decimal places

Cube root128.073464501≈

Negation-2,100,765

Reciprocal4.7601707 × 10^-7≈

Representations

Decimal2,100,765

Binary100000000011100001110122 bits

Octal10007035

Hexadecimal200E1D

Base 36190YL

Roman numeralNot defined above 3,999there is no agreed standard notation

In wordstwo million, one hundred thousand, seven hundred and sixty-five

Ordinaltwo million, one hundred thousand, seven hundred and sixty-fifth

Scientific notation2.100765 × 10^6

Engineering notation2.100765 × 10^6

In other bases

Ternary10221201201010base 3; the most digit-efficient integer base after e: 14 digits

Quinary1014211030base 5; one hand: 10 digits

Septenary23566452base 7: 8 digits

Nonary3851633base 9; each digit is two ternary digits: 7 digits

Duodecimal853879base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits

Vigesimald2bi5base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits

Sexagesimal9:43:32:45base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

Balanced ternary1100TT1TT01010digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed

Negabinary11000000001001001101101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000001000000000111000011101

Bit length22 bitsto write the magnitude

Set bits8the population count, or Hamming weight

Zero bits14within that length

Bit parityeven8 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 0e 1d

Gray code1100000000100100010011n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000001000000000111000011101

64-bit0000000000000000000000000000000000000000001000000000111000011101

One's complement11111111110111111111000111100010at 32 bits, every bit flipped

Bits reversed10111000011100000000010000000000at 32 bits

Rotated left by 100000000010000000001110000111010at 32 bits, wrapping

Shifted left by 110000000001110000111010= 4,201,530, no wrap

Shifted right by 1100000000011100001110= 1,050,382, discarding the low bit

These bits as a double1.03791582 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime2,100,781+16

Previous prime2,100,743−22

Distance to nearest prime16

Nearest square below2,099,601

Nearest square above2,102,500

Powers & multiples

2,100,765 to the power 24,413,213,585,225

2,100,765 to the power 39,271,124,637,365,197,125

2,100,765 to the power 419,476,454,148,814,498,338,300,625

2,100,765 to the power 540,915,453,199,934,289,601,660,112,478,125

First ten multiples2,100,765, 4,201,530, 6,302,295, 8,403,060, 10,503,825, 12,604,590, 14,705,355, 16,806,120, 18,906,885, 21,007,650

Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3Yes

Divisible by 4No, remainder 1

Divisible by 5Yes

Divisible by 6No, remainder 3

Divisible by 7No, remainder 2

Divisible by 8No, remainder 5

Divisible by 9No, remainder 3

Divisible by 10No, remainder 5

Divisible by 11No, remainder 7

Divisible by 12No, remainder 9

Divisible by 100No, remainder 65

Collatz (3n + 1) trajectory

Steps to reach 173the total stopping time

Highest value reached6,302,2963× the starting value

Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven

First steps2,100,765 → 6,302,296 → 3,151,148 → 1,575,574 → 787,787 → 2,363,362 → 1,181,681 → 3,545,044 → 1,772,522 → 886,261 → …

Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage210,076,500%

2,100,765% as a decimal21,007.65

2,100,765% of 1002,100,765

2,100,765% of 1,00021,007,650

As a fraction of 1002,100,765/100

Read another way

As seconds24 days, 7 hours and 32 minutes

As bytes2.003 MiB

As a 24-bit colour#200E1D

Keep nerding

Every link below is a page Nerdulator can generate from what it already knows about this value.