Number
1,131,561
- Positive
- Odd
- Composite
- 7 digits
1,131,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,131,561
Digit count7
Digit sum18
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 × 59 × 2,131
Distinct prime factors33, 59, 2,131
Number of divisors12
Sum of divisors σ(n)1,662,960
Aliquot sum531,399sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)741,240integers below n that share no factor with it
SquarefreeNohas a repeated prime factor
All divisors1, 3, 9, 59, 177, 531, 2,131, 6,393, 19,179, 125,729, 377,187, 1,131,56112 in total
Arithmetic
Previous number1,131,560
Next number1,131,562
Double2,263,122
Half565,780.5
Square1,280,430,296,721
Cube1,448,884,986,987,911,481
Square root1,063.748560516≈irrational, shown to 9 decimal places
Cube root104.205983523≈
Negation-1,131,561
Reciprocal8.83734947 × 10^-7≈
Representations
Decimal1,131,561
Binary10001010001000010100121 bits
Octal4242051
Hexadecimal114429
Base 36O949
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, one hundred and thirty-one thousand, five hundred and sixty-one
Ordinalone million, one hundred and thirty-one thousand, five hundred and sixty-first
Scientific notation1.131561 × 10^6
Engineering notation1.131561 × 10^6
Nearest landmarks
Powers & multiples
1,131,561 to the power 21,280,430,296,721
1,131,561 to the power 31,448,884,986,987,911,481
1,131,561 to the power 41,639,501,744,761,028,103,351,841
1,131,561 to the power 51,855,196,233,803,533,721,656,912,553,801
First ten multiples1,131,561, 2,263,122, 3,394,683, 4,526,244, 5,657,805, 6,789,366, 7,920,927, 9,052,488, 10,184,049, 11,315,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 4
Divisible by 8No, remainder 1
Divisible by 9Yes
Divisible by 10No, remainder 1
Divisible by 11No, remainder 2
Divisible by 12No, remainder 9
Divisible by 100No, remainder 61
Collatz (3n + 1) trajectory
Steps to reach 1222the total stopping time
Highest value reached12,889,20411× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,131,561 → 3,394,684 → 1,697,342 → 848,671 → 2,546,014 → 1,273,007 → 3,819,022 → 1,909,511 → 5,728,534 → 2,864,267 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage113,156,100%
1,131,561% as a decimal11,315.61
1,131,561% of 1001,131,561
1,131,561% of 1,00011,315,610
As a fraction of 1001,131,561/100
Read another way
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from 1,131,561
Nerdulate something else
Nothing in mind? Surprise me · today’s page