Recognised as Number
1,143,103
- Positive
- Odd
- Composite
- 7 digits
1,143,103 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,143,103
Digit count7
Digit sum13
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberYesdivisible by its own digit sum
Factors & divisors
Prime factorisation13 × 87,931
Distinct prime factors213, 87,931
Number of divisors4
Sum of divisors σ(n)1,231,048
Aliquot sum87,945sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,055,160integers below n that share no factor with it
Carmichael function λ(n)175,860the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,055,160
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 13, 87,931, 1,143,1034 in total
Arithmetic
Previous number1,143,102
Next number1,143,104
Double2,286,206
Half571,551.5
Square1,306,684,468,609
Cube1,493,674,936,120,353,727
Square root1,069.159950615≈irrational, shown to 9 decimal places
Cube root104.559088398≈
Negation-1,143,103
Reciprocal8.74811806 × 10^-7≈
Representations
Decimal1,143,103
Binary10001011100010011111121 bits
Octal4270477
Hexadecimal11713F
Base 36OI0V
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, one hundred and forty-three thousand, one hundred and three
Ordinalone million, one hundred and forty-three thousand, one hundred and third
Scientific notation1.143103 × 10^6
Engineering notation1.143103 × 10^6
In other bases
Ternary2011002001011base 3; the most digit-efficient integer base after e: 13 digits
Quinary243034403base 5; one hand: 9 digits
Septenary12500443base 7: 8 digits
Nonary2132034base 9; each digit is two ternary digits: 7 digits
Duodecimal471627base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal72hf3base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal5:17:31:43base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T01101T001011digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101101011000101000011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100010111000100111111
Bit length21 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits9within that length
Bit parityeven12 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 71 3f
Gray code110011100100110100000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100010111000100111111
64-bit0000000000000000000000000000000000000000000100010111000100111111
One's complement11111111111011101000111011000000at 32 bits, every bit flipped
Bits reversed11111100100011101000100000000000at 32 bits
Rotated left by 100000000001000101110001001111110at 32 bits, wrapping
Shifted left by 11000101110001001111110= 2,286,206, no wrap
Shifted right by 110001011100010011111= 571,551, discarding the low bit
These bits as a double5.64767922 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,143,103 to the power 21,306,684,468,609
1,143,103 to the power 31,493,674,936,120,353,727
1,143,103 to the power 41,707,424,300,503,984,706,394,881
1,143,103 to the power 51,951,761,840,179,006,429,834,107,655,743
First ten multiples1,143,103, 2,286,206, 3,429,309, 4,572,412, 5,715,515, 6,858,618, 8,001,721, 9,144,824, 10,287,927, 11,431,030
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 3
Divisible by 8No, remainder 7
Divisible by 9No, remainder 4
Divisible by 10No, remainder 3
Divisible by 11No, remainder 5
Divisible by 12No, remainder 7
Divisible by 100No, remainder 3
Collatz (3n + 1) trajectory
Steps to reach 1359the total stopping time
Highest value reached812,737,312710× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,143,103 → 3,429,310 → 1,714,655 → 5,143,966 → 2,571,983 → 7,715,950 → 3,857,975 → 11,573,926 → 5,786,963 → 17,360,890 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage114,310,300%
1,143,103% as a decimal11,431.03
1,143,103% of 1001,143,103
1,143,103% of 1,00011,431,030
As a fraction of 1001,143,103/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,143,103
Nerdulate something else
Nothing in mind? Surprise me · today’s page