Recognised as Number
1,128,063
- Positive
- Odd
- Composite
- 7 digits
1,128,063 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 3.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,128,063
Digit count7
Digit sum21
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root3repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3 × 376,021
Distinct prime factors23, 376,021
Number of divisors4
Sum of divisors σ(n)1,504,088
Aliquot sum376,025sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)752,040integers below n that share no factor with it
Carmichael function λ(n)376,020the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 752,040
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 3, 376,021, 1,128,0634 in total
Arithmetic
Previous number1,128,062
Next number1,128,064
Double2,256,126
Half564,031.5
Square1,272,526,131,969
Cube1,435,489,646,007,346,047
Square root1,062.10310234≈irrational, shown to 9 decimal places
Cube root104.0984952≈
Negation-1,128,063
Reciprocal8.86475312 × 10^-7≈
Representations
Decimal1,128,063
Binary10001001101100111111121 bits
Octal4233177
Hexadecimal11367F
Base 36O6F3
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, one hundred and twenty-eight thousand and sixty-three
Ordinalone million, one hundred and twenty-eight thousand and sixty-third
Scientific notation1.128063 × 10^6
Engineering notation1.128063 × 10^6
In other bases
Ternary2010022102010base 3; the most digit-efficient integer base after e: 13 digits
Quinary242044223base 5; one hand: 9 digits
Septenary12405546base 7: 8 digits
Nonary2108363base 9; each digit is two ternary digits: 7 digits
Duodecimal464993base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal71033base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal5:13:21:3base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T01010T11T010digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100010100101110000011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100010011011001111111
Bit length21 bitsto write the magnitude
Set bits13the population count, or Hamming weight
Zero bits8within that length
Bit parityodd13 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
Bytes311 36 7f
Gray code110011010110101000000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100010011011001111111
64-bit0000000000000000000000000000000000000000000100010011011001111111
One's complement11111111111011101100100110000000at 32 bits, every bit flipped
Bits reversed11111110011011001000100000000000at 32 bits
Rotated left by 100000000001000100110110011111110at 32 bits, wrapping
Shifted left by 11000100110110011111110= 2,256,126, no wrap
Shifted right by 110001001101100111111= 564,031, discarding the low bit
These bits as a double5.57337175 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,128,063 to the power 21,272,526,131,969
1,128,063 to the power 31,435,489,646,007,346,047
1,128,063 to the power 41,619,322,756,543,984,803,816,961
1,128,063 to the power 51,826,698,086,715,277,129,748,172,476,543
First ten multiples1,128,063, 2,256,126, 3,384,189, 4,512,252, 5,640,315, 6,768,378, 7,896,441, 9,024,504, 10,152,567, 11,280,630
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 3
Divisible by 5No, remainder 3
Divisible by 6No, remainder 3
Divisible by 7No, remainder 6
Divisible by 8No, remainder 7
Divisible by 9No, remainder 3
Divisible by 10No, remainder 3
Divisible by 11No, remainder 2
Divisible by 12No, remainder 3
Divisible by 100No, remainder 63
Collatz (3n + 1) trajectory
Steps to reach 1160the total stopping time
Highest value reached65,049,85657× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,128,063 → 3,384,190 → 1,692,095 → 5,076,286 → 2,538,143 → 7,614,430 → 3,807,215 → 11,421,646 → 5,710,823 → 17,132,470 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage112,806,300%
1,128,063% as a decimal11,280.63
1,128,063% of 1001,128,063
1,128,063% of 1,00011,280,630
As a fraction of 1001,128,063/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,128,063
Nerdulate something else
Nothing in mind? Surprise me · today’s page