Recognised as Number

1,131,594

Positive
Even
Composite
7 digits

1,131,594 is an even 7-digit integer and a composite number. It has 16 divisors and a digital root of 6.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value1,131,594

Digit count7

Digit sum24

Digit product540

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

Digital root6repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 3 × 151 × 1,249

Distinct prime factors42, 3, 151, 1,249

Number of divisors16

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

Aliquot sum1,148,406sum of the proper divisors

ClassificationAbundantthe aliquot sum exceeds the number

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

Carmichael function λ(n)31,200the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 374,400

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

SquarefreeYesno repeated prime factor

All divisors1, 2, 3, 6, 151, 302, 453, 906, 1,249, 2,498, 3,747, 7,494, 188,599, 377,198, 565,797, 1,131,59416 in total

Arithmetic

Previous number1,131,593

Next number1,131,595

Double2,263,188

Half565,797

Square1,280,504,980,836

Cube1,449,011,753,284,132,584

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

Cube root104.206996508≈

Negation-1,131,594

Reciprocal8.83709175 × 10^-7≈

Representations

Decimal1,131,594

Binary10001010001000100101021 bits

Octal4242112

Hexadecimal11444A

Base 36O956

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

In wordsone million, one hundred and thirty-one thousand, five hundred and ninety-four

Ordinalone million, one hundred and thirty-one thousand, five hundred and ninety-fourth

Scientific notation1.131594 × 10^6

Engineering notation1.131594 × 10^6

In other bases

Ternary2010111020220base 3; the most digit-efficient integer base after e: 13 digits

Quinary242202334base 5; one hand: 9 digits

Septenary12422052base 7: 8 digits

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

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

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

Sexagesimal5:14:19:54base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000000100010100010001001010

Bit length21 bitsto write the magnitude

Set bits7the population count, or Hamming weight

Zero bits14within that length

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

Highest set bitbit 20worth 1,048,576

Lowest set bitbit 11 trailing zero

Power of twoNo

Bytes311 44 4a

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

At each machine width

32-bit00000000000100010100010001001010

64-bit0000000000000000000000000000000000000000000100010100010001001010

One's complement11111111111011101011101110110101at 32 bits, every bit flipped

Bits reversed01010010001000101000100000000000at 32 bits

Rotated left by 100000000001000101000100010010100at 32 bits, wrapping

Shifted left by 11000101000100010010100= 2,263,188, no wrap

Shifted right by 110001010001000100101= 565,797, discarding the low bit

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

Nearest landmarks

Next prime1,131,617+23

Previous prime1,131,569−25

Distance to nearest prime23

Nearest square below1,129,969

Nearest square above1,132,096

Powers & multiples

1,131,594 to the power 21,280,504,980,836

1,131,594 to the power 31,449,011,753,284,132,584

1,131,594 to the power 41,639,693,005,945,804,727,258,896

1,131,594 to the power 51,855,466,767,370,236,954,537,803,160,224

First ten multiples1,131,594, 2,263,188, 3,394,782, 4,526,376, 5,657,970, 6,789,564, 7,921,158, 9,052,752, 10,184,346, 11,315,940

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

Divisibility tests

Divisible by 2Yes

Divisible by 3Yes

Divisible by 4No, remainder 2

Divisible by 5No, remainder 4

Divisible by 6Yes

Divisible by 7No, remainder 2

Divisible by 8No, remainder 2

Divisible by 9No, remainder 6

Divisible by 10No, remainder 4

Divisible by 11No, remainder 2

Divisible by 12No, remainder 6

Divisible by 100No, remainder 94

Collatz (3n + 1) trajectory

Steps to reach 185the total stopping time

Highest value reached1,812,6161× the starting value

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

First steps1,131,594 → 565,797 → 1,697,392 → 848,696 → 424,348 → 212,174 → 106,087 → 318,262 → 159,131 → 477,394 → …

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

As a percentage & fraction

As a percentage113,159,400%

1,131,594% as a decimal11,315.94

1,131,594% of 1001,131,594

1,131,594% of 1,00011,315,940

As a fraction of 1001,131,594/100

Read another way

As seconds13 days, 2 hours and 19 minutes

As bytes1.079 MiB

As a 24-bit colour#11444A

Keep nerding

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