Recognised as Number
1,130,527
- Positive
- Odd
- Prime
- 7 digits
1,130,527 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value1,130,527
Digit count7
Digit sum19
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation1,130,527
Distinct prime factors11,130,527
Number of divisors2
Sum of divisors σ(n)1,130,528
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,130,526integers below n that share no factor with it
Carmichael function λ(n)1,130,526the 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,130,5272 in total
Arithmetic
Previous number1,130,526
Next number1,130,528
Double2,261,054
Half565,263.5
Square1,278,091,297,729
Cube1,444,916,720,547,673,183
Square root1,063.262432328≈irrational, shown to 9 decimal places
Cube root104.174233335≈
Negation-1,130,527
Reciprocal8.84543226 × 10^-7≈
Representations
Decimal1,130,527
Binary10001010000000001111121 bits
Octal4240037
Hexadecimal11401F
Base 36O8BJ
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, one hundred and thirty thousand, five hundred and twenty-seven
Ordinalone million, one hundred and thirty thousand, five hundred and twenty-seventh
Scientific notation1.130527 × 10^6
Engineering notation1.130527 × 10^6
In other bases
Ternary2010102210101base 3; the most digit-efficient integer base after e: 13 digits
Quinary242134102base 5; one hand: 9 digits
Septenary12415666base 7: 8 digits
Nonary2112711base 9; each digit is two ternary digits: 7 digits
Duodecimal4662a7base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal71667base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal5:14:2:7base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T010110T10101digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100010100000001100011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100010100000000011111
Bit length21 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits13within that length
Bit parityeven8 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 40 1f
Gray code110011110000000010000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100010100000000011111
64-bit0000000000000000000000000000000000000000000100010100000000011111
One's complement11111111111011101011111111100000at 32 bits, every bit flipped
Bits reversed11111000000000101000100000000000at 32 bits
Rotated left by 100000000001000101000000000111110at 32 bits, wrapping
Shifted left by 11000101000000000111110= 2,261,054, no wrap
Shifted right by 110001010000000001111= 565,263, discarding the low bit
These bits as a double5.58554552 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,130,527 to the power 21,278,091,297,729
1,130,527 to the power 31,444,916,720,547,673,183
1,130,527 to the power 41,633,517,365,330,599,320,557,441
1,130,527 to the power 51,846,735,486,475,106,458,071,842,101,407
First ten multiples1,130,527, 2,261,054, 3,391,581, 4,522,108, 5,652,635, 6,783,162, 7,913,689, 9,044,216, 10,174,743, 11,305,270
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 2
Divisible by 6No, remainder 1
Divisible by 7No, remainder 6
Divisible by 8No, remainder 7
Divisible by 9No, remainder 1
Divisible by 10No, remainder 7
Divisible by 11No, remainder 2
Divisible by 12No, remainder 7
Divisible by 100No, remainder 27
Collatz (3n + 1) trajectory
Steps to reach 1253the total stopping time
Highest value reached36,670,48032× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,130,527 → 3,391,582 → 1,695,791 → 5,087,374 → 2,543,687 → 7,631,062 → 3,815,531 → 11,446,594 → 5,723,297 → 17,169,892 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage113,052,700%
1,130,527% as a decimal11,305.27
1,130,527% of 1001,130,527
1,130,527% of 1,00011,305,270
As a fraction of 1001,130,527/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,130,527
Nerdulate something else
Nothing in mind? Surprise me · today’s page