Recognised as Number

1,775,331

Positive
Odd
Composite
7 digits

1,775,331 is an odd 7-digit integer and a composite number. It has 16 divisors and a digital root of 9.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value1,775,331

Digit count7

Digit sum27

Digit product2,205

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 numberYesdivisible by its own digit sum

Factors & divisors

Prime factorisation3^3 × 47 × 1,399

Distinct prime factors33, 47, 1,399

Number of divisors16

Sum of divisors σ(n)2,688,000

Aliquot sum912,669sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)96,462the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,157,544

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

SquarefreeNohas a repeated prime factor

All divisors1, 3, 9, 27, 47, 141, 423, 1,269, 1,399, 4,197, 12,591, 37,773, 65,753, 197,259, 591,777, 1,775,33116 in total

Arithmetic

Previous number1,775,330

Next number1,775,332

Double3,550,662

Half887,665.5

Square3,151,800,159,561

Cube5,595,488,529,073,589,691

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

Cube root121.085771211≈

Negation-1,775,331

Reciprocal5.63275243 × 10^-7≈

Representations

Decimal1,775,331

Binary11011000101101110001121 bits

Octal6613343

Hexadecimal1B16E3

Base 36121UR

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

In wordsone million, seven hundred and seventy-five thousand, three hundred and thirty-one

Ordinalone million, seven hundred and seventy-five thousand, three hundred and thirty-first

Scientific notation1.775331 × 10^6

Engineering notation1.775331 × 10^6

In other bases

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

Quinary423302311base 5; one hand: 9 digits

Septenary21042615base 7: 8 digits

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

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

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

Sexagesimal8:13:8:51base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000000110110001011011100011

Bit length21 bitsto write the magnitude

Set bits12the population count, or Hamming weight

Zero bits9within that length

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

Highest set bitbit 20worth 1,048,576

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes31b 16 e3

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

At each machine width

32-bit00000000000110110001011011100011

64-bit0000000000000000000000000000000000000000000110110001011011100011

One's complement11111111111001001110100100011100at 32 bits, every bit flipped

Bits reversed11000111011010001101100000000000at 32 bits

Rotated left by 100000000001101100010110111000110at 32 bits, wrapping

Shifted left by 11101100010110111000110= 3,550,662, no wrap

Shifted right by 111011000101101110001= 887,665, discarding the low bit

These bits as a double8.77130057 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime1,775,353+22

Previous prime1,775,329−2

Distance to nearest prime2

Nearest square below1,774,224

Nearest square above1,776,889

Powers & multiples

1,775,331 to the power 23,151,800,159,561

1,775,331 to the power 35,595,488,529,073,589,691

1,775,331 to the power 49,933,844,245,808,745,059,712,721

1,775,331 to the power 517,635,861,638,755,885,175,604,844,685,651

First ten multiples1,775,331, 3,550,662, 5,325,993, 7,101,324, 8,876,655, 10,651,986, 12,427,317, 14,202,648, 15,977,979, 17,753,310

Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3Yes

Divisible by 4No, remainder 3

Divisible by 5No, remainder 1

Divisible by 6No, remainder 3

Divisible by 7No, remainder 5

Divisible by 8No, remainder 3

Divisible by 9Yes

Divisible by 10No, remainder 1

Divisible by 11No, remainder 8

Divisible by 12No, remainder 3

Divisible by 100No, remainder 31

Collatz (3n + 1) trajectory

Steps to reach 1189the total stopping time

Highest value reached7,988,9924× the starting value

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

First steps1,775,331 → 5,325,994 → 2,662,997 → 7,988,992 → 3,994,496 → 1,997,248 → 998,624 → 499,312 → 249,656 → 124,828 → …

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

As a percentage & fraction

As a percentage177,533,100%

1,775,331% as a decimal17,753.31

1,775,331% of 1001,775,331

1,775,331% of 1,00017,753,310

As a fraction of 1001,775,331/100

Read another way

As seconds20 days, 13 hours and 8 minutes

As bytes1.693 MiB

As a 24-bit colour#1B16E3

Keep nerding

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