Recognised as Number
1,131,523
- Positive
- Odd
- Prime
- 7 digits
1,131,523 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value1,131,523
Digit count7
Digit sum16
Digit product90
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation1,131,523
Distinct prime factors11,131,523
Number of divisors2
Sum of divisors σ(n)1,131,524
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,131,522integers below n that share no factor with it
Carmichael function λ(n)1,131,522the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)−11 distinct prime factor, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 1,131,5232 in total
Arithmetic
Previous number1,131,522
Next number1,131,524
Double2,263,046
Half565,761.5
Square1,280,344,299,529
Cube1,448,739,022,835,952,667
Square root1,063.730699002≈irrational, shown to 9 decimal places
Cube root104.20481703≈
Negation-1,131,523
Reciprocal8.83764625 × 10^-7≈
Representations
Decimal1,131,523
Binary10001010001000000001121 bits
Octal4242003
Hexadecimal114403
Base 36O937
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, one hundred and thirty-one thousand, five hundred and twenty-three
Ordinalone million, one hundred and thirty-one thousand, five hundred and twenty-third
Scientific notation1.131523 × 10^6
Engineering notation1.131523 × 10^6
In other bases
Ternary2010111011021base 3; the most digit-efficient integer base after e: 13 digits
Quinary242202043base 5; one hand: 9 digits
Septenary12421621base 7: 8 digits
Nonary2114137base 9; each digit is two ternary digits: 7 digits
Duodecimal466997base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal718g3base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal5:14:18:43base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0101110111T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100010100010000000111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100010100010000000011
Bit length21 bitsto write the magnitude
Set bits6the population count, or Hamming weight
Zero bits15within that length
Bit parityeven6 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
Bytes311 44 03
Gray code110011110011000000010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100010100010000000011
64-bit0000000000000000000000000000000000000000000100010100010000000011
One's complement11111111111011101011101111111100at 32 bits, every bit flipped
Bits reversed11000000001000101000100000000000at 32 bits
Rotated left by 100000000001000101000100000000110at 32 bits, wrapping
Shifted left by 11000101000100000000110= 2,263,046, no wrap
Shifted right by 110001010001000000001= 565,761, discarding the low bit
These bits as a double5.59046642 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,131,523 to the power 21,280,344,299,529
1,131,523 to the power 31,448,739,022,835,952,667
1,131,523 to the power 41,639,281,525,336,405,669,621,841
1,131,523 to the power 51,854,884,749,393,225,752,507,514,393,843
First ten multiples1,131,523, 2,263,046, 3,394,569, 4,526,092, 5,657,615, 6,789,138, 7,920,661, 9,052,184, 10,183,707, 11,315,230
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 3
Divisible by 5No, remainder 3
Divisible by 6No, remainder 1
Divisible by 7No, remainder 1
Divisible by 8No, remainder 3
Divisible by 9No, remainder 7
Divisible by 10No, remainder 3
Divisible by 11No, remainder 8
Divisible by 12No, remainder 7
Divisible by 100No, remainder 23
Collatz (3n + 1) trajectory
Steps to reach 185the total stopping time
Highest value reached5,091,8564× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,131,523 → 3,394,570 → 1,697,285 → 5,091,856 → 2,545,928 → 1,272,964 → 636,482 → 318,241 → 954,724 → 477,362 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage113,152,300%
1,131,523% as a decimal11,315.23
1,131,523% of 1001,131,523
1,131,523% of 1,00011,315,230
As a fraction of 1001,131,523/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,523
Nerdulate something else
Nothing in mind? Surprise me · today’s page