Recognised as Number

2,765,406

Positive
Even
Composite
7 digits

2,765,406 is an even 7-digit integer and a composite number. It has 16 divisors and a digital root of 3.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value2,765,406

Digit count7

Digit sum30

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 factorisation2 × 3 × 7 × 65,843

Distinct prime factors42, 3, 7, 65,843

Number of divisors16

Sum of divisors σ(n)6,321,024

Aliquot sum3,555,618sum of the proper divisors

ClassificationAbundantthe aliquot sum exceeds the number

Euler's totient φ(n)790,104integers below n that share no factor with it

Carmichael function λ(n)197,526the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 790,104

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

SquarefreeYesno repeated prime factor

All divisors1, 2, 3, 6, 7, 14, 21, 42, 65,843, 131,686, 197,529, 395,058, 460,901, 921,802, 1,382,703, 2,765,40616 in total

Arithmetic

Previous number2,765,405

Next number2,765,407

Double5,530,812

Half1,382,703

Square7,647,470,344,836

Cube21,148,360,376,431,543,416

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

Cube root140.363105053≈

Negation-2,765,406

Reciprocal3.61610556 × 10^-7≈

Representations

Decimal2,765,406

Binary101010001100100101111022 bits

Octal12431136

Hexadecimal2A325E

Base 361N9SU

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

In wordstwo million, seven hundred and sixty-five thousand, four hundred and six

Ordinaltwo million, seven hundred and sixty-five thousand, four hundred and sixth

Scientific notation2.765406 × 10^6

Engineering notation2.765406 × 10^6

In other bases

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

Quinary1201443111base 5; one hand: 10 digits

Septenary32335260base 7: 8 digits

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

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

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

Sexagesimal12:48:10:6base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000001010100011001001011110

Bit length22 bitsto write the magnitude

Set bits11the population count, or Hamming weight

Zero bits11within that length

Bit parityodd11 set bits, so odd; not the same as the number itself being even

Highest set bitbit 21worth 2,097,152

Lowest set bitbit 11 trailing zero

Power of twoNo

Bytes32a 32 5e

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

At each machine width

32-bit00000000001010100011001001011110

64-bit0000000000000000000000000000000000000000001010100011001001011110

One's complement11111111110101011100110110100001at 32 bits, every bit flipped

Bits reversed01111010010011000101010000000000at 32 bits

Rotated left by 100000000010101000110010010111100at 32 bits, wrapping

Shifted left by 110101000110010010111100= 5,530,812, no wrap

Shifted right by 1101010001100100101111= 1,382,703, discarding the low bit

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

Nearest landmarks

Next prime2,765,419+13

Previous prime2,765,387−19

Distance to nearest prime13

Nearest square below2,762,244

Nearest square above2,765,569

Powers & multiples

2,765,406 to the power 27,647,470,344,836

2,765,406 to the power 321,148,360,376,431,543,416

2,765,406 to the power 458,483,802,675,146,048,751,866,896

2,765,406 to the power 5161,731,458,820,664,934,094,705,225,399,776

First ten multiples2,765,406, 5,530,812, 8,296,218, 11,061,624, 13,827,030, 16,592,436, 19,357,842, 22,123,248, 24,888,654, 27,654,060

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

Divisibility tests

Divisible by 2Yes

Divisible by 3Yes

Divisible by 4No, remainder 2

Divisible by 5No, remainder 1

Divisible by 6Yes

Divisible by 7Yes

Divisible by 8No, remainder 6

Divisible by 9No, remainder 3

Divisible by 10No, remainder 6

Divisible by 11No, remainder 6

Divisible by 12No, remainder 6

Divisible by 100No, remainder 6

Collatz (3n + 1) trajectory

Steps to reach 181the total stopping time

Highest value reached13,999,8765× the starting value

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

First steps2,765,406 → 1,382,703 → 4,148,110 → 2,074,055 → 6,222,166 → 3,111,083 → 9,333,250 → 4,666,625 → 13,999,876 → 6,999,938 → …

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

As a percentage & fraction

As a percentage276,540,600%

2,765,406% as a decimal27,654.06

2,765,406% of 1002,765,406

2,765,406% of 1,00027,654,060

As a fraction of 1002,765,406/100

Read another way

As seconds32 days, 10 minutes and 6 seconds

As bytes2.637 MiB

As a 24-bit colour#2A325E

Keep nerding

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