Recognised as Number

1,185,561

Positive
Odd
Composite
7 digits

1,185,561 is an odd 7-digit integer and a composite number. It has 12 divisors and a digital root of 9.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value1,185,561

Digit count7

Digit sum27

Digit product1,200

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 × 10,133

Distinct prime factors33, 13, 10,133

Number of divisors12

Sum of divisors σ(n)1,844,388

Aliquot sum658,827sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)30,396the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 729,504

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

SquarefreeNohas a repeated prime factor

All divisors1, 3, 9, 13, 39, 117, 10,133, 30,399, 91,197, 131,729, 395,187, 1,185,56112 in total

Arithmetic

Previous number1,185,560

Next number1,185,562

Double2,371,122

Half592,780.5

Square1,405,554,884,721

Cube1,666,371,054,684,713,481

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

Cube root105.837921281≈

Negation-1,185,561

Reciprocal8.43482537 × 10^-7≈

Representations

Decimal1,185,561

Binary10010000101110001100121 bits

Octal4413431

Hexadecimal121719

Base 36PES9

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

In wordsone million, one hundred and eighty-five thousand, five hundred and sixty-one

Ordinalone million, one hundred and eighty-five thousand, five hundred and sixty-first

Scientific notation1.185561 × 10^6

Engineering notation1.185561 × 10^6

In other bases

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

Quinary300414221base 5; one hand: 9 digits

Septenary13035306base 7: 8 digits

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

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

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

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

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

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

Bit-level

00000000000100100001011100011001

Bit length21 bitsto write the magnitude

Set bits9the population count, or Hamming weight

Zero bits12within that length

Bit parityodd9 set bits, so odd; 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

Bytes312 17 19

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

At each machine width

32-bit00000000000100100001011100011001

64-bit0000000000000000000000000000000000000000000100100001011100011001

One's complement11111111111011011110100011100110at 32 bits, every bit flipped

Bits reversed10011000111010000100100000000000at 32 bits

Rotated left by 100000000001001000010111000110010at 32 bits, wrapping

Shifted left by 11001000010111000110010= 2,371,122, no wrap

Shifted right by 110010000101110001100= 592,780, discarding the low bit

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

Nearest landmarks

Next prime1,185,577+16

Previous prime1,185,559−2

Distance to nearest prime2

Nearest square below1,183,744

Nearest square above1,185,921

Powers & multiples

1,185,561 to the power 21,405,554,884,721

1,185,561 to the power 31,666,371,054,684,713,481

1,185,561 to the power 41,975,584,533,963,063,599,247,841

1,185,561 to the power 52,342,175,975,669,783,643,787,869,623,801

First ten multiples1,185,561, 2,371,122, 3,556,683, 4,742,244, 5,927,805, 7,113,366, 8,298,927, 9,484,488, 10,670,049, 11,855,610

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 1

Divisible by 5No, remainder 1

Divisible by 6No, remainder 3

Divisible by 7No, remainder 6

Divisible by 8No, remainder 1

Divisible by 9Yes

Divisible by 10No, remainder 1

Divisible by 11No, remainder 3

Divisible by 12No, remainder 9

Divisible by 100No, remainder 61

Collatz (3n + 1) trajectory

Steps to reach 198the total stopping time

Highest value reached19,227,83216× the starting value

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

First steps1,185,561 → 3,556,684 → 1,778,342 → 889,171 → 2,667,514 → 1,333,757 → 4,001,272 → 2,000,636 → 1,000,318 → 500,159 → …

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

As a percentage & fraction

As a percentage118,556,100%

1,185,561% as a decimal11,855.61

1,185,561% of 1001,185,561

1,185,561% of 1,00011,855,610

As a fraction of 1001,185,561/100

Read another way

As seconds13 days, 17 hours and 19 minutes

As bytes1.131 MiB

As a 24-bit colour#121719

Keep nerding

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