Recognised as Number

2,765,997

Positive
Odd
Composite
7 digits

2,765,997 is an odd 7-digit integer and a composite number. It has 24 divisors and a digital root of 9.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value2,765,997

Digit count7

Digit sum45

Digit product238,140

Multiplicative persistence2times the digit product can be taken before one digit is left

Digital root9repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3^2 × 13 × 47 × 503

Distinct prime factors43, 13, 47, 503

Number of divisors24

Sum of divisors σ(n)4,402,944

Aliquot sum1,636,947sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)69,276the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,662,624

Möbius function μ(n)0zero, because a prime divides n twice

SquarefreeNohas a repeated prime factor

All divisors1, 3, 9, 13, 39, 47, 117, 141, 423, 503, 611, 1,509, 1,833, 4,527, 5,499, 6,539, 19,617, 23,641, 58,851, 70,923, 212,769, 307,333, 921,999, 2,765,99724 in total

Arithmetic

Previous number2,765,996

Next number2,765,998

Double5,531,994

Half1,382,998.5

Square7,650,739,404,009

Cube21,161,922,239,270,681,973

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

Cube root140.373103426≈

Negation-2,765,997

Reciprocal3.61533292 × 10^-7≈

Representations

Decimal2,765,997

Binary101010001101001010110122 bits

Octal12432255

Hexadecimal2A34AD

Base 361NA99

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

In wordstwo million, seven hundred and sixty-five thousand, nine hundred and ninety-seven

Ordinaltwo million, seven hundred and sixty-five thousand, nine hundred and ninety-seventh

Scientific notation2.765997 × 10^6

Engineering notation2.765997 × 10^6

In other bases

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

Quinary1202002442base 5; one hand: 10 digits

Septenary32340063base 7: 8 digits

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

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

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

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

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

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

Bit-level

00000000001010100011010010101101

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 odd

Highest set bitbit 21worth 2,097,152

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes32a 34 ad

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

At each machine width

32-bit00000000001010100011010010101101

64-bit0000000000000000000000000000000000000000001010100011010010101101

One's complement11111111110101011100101101010010at 32 bits, every bit flipped

Bits reversed10110101001011000101010000000000at 32 bits

Rotated left by 100000000010101000110100101011010at 32 bits, wrapping

Shifted left by 110101000110100101011010= 5,531,994, no wrap

Shifted right by 1101010001101001010110= 1,382,998, discarding the low bit

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

Nearest landmarks

Next prime2,766,007+10

Previous prime2,765,977−20

Distance to nearest prime10

Nearest square below2,765,569

Nearest square above2,768,896

Powers & multiples

2,765,997 to the power 27,650,739,404,009

2,765,997 to the power 321,161,922,239,270,681,973

2,765,997 to the power 458,533,813,428,055,988,525,272,081

2,765,997 to the power 5161,904,352,340,562,580,092,937,000,229,757

First ten multiples2,765,997, 5,531,994, 8,297,991, 11,063,988, 13,829,985, 16,595,982, 19,361,979, 22,127,976, 24,893,973, 27,659,970

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 5No, remainder 2

Divisible by 6No, remainder 3

Divisible by 7No, remainder 3

Divisible by 8No, remainder 5

Divisible by 9Yes

Divisible by 10No, remainder 7

Divisible by 11No, remainder 3

Divisible by 12No, remainder 9

Divisible by 100No, remainder 97

Collatz (3n + 1) trajectory

Steps to reach 181the total stopping time

Highest value reached8,297,9923× the starting value

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

First steps2,765,997 → 8,297,992 → 4,148,996 → 2,074,498 → 1,037,249 → 3,111,748 → 1,555,874 → 777,937 → 2,333,812 → 1,166,906 → …

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

As a percentage & fraction

As a percentage276,599,700%

2,765,997% as a decimal27,659.97

2,765,997% of 1002,765,997

2,765,997% of 1,00027,659,970

As a fraction of 1002,765,997/100

Read another way

As seconds32 days, 19 minutes and 57 seconds

As bytes2.638 MiB

As a 24-bit colour#2A34AD

Keep nerding

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