Recognised as Number
1,111,303
- Positive
- Odd
- Composite
- 7 digits
1,111,303 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,111,303
Digit count7
Digit sum10
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 factorisation101 × 11,003
Distinct prime factors2101, 11,003
Number of divisors4
Sum of divisors σ(n)1,122,408
Aliquot sum11,105sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,100,200integers below n that share no factor with it
Carmichael function λ(n)550,100the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,100,200
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 101, 11,003, 1,111,3034 in total
Arithmetic
Previous number1,111,302
Next number1,111,304
Double2,222,606
Half555,651.5
Square1,234,994,357,809
Cube1,372,452,934,816,215,127
Square root1,054.183570352≈irrational, shown to 9 decimal places
Cube root103.580378956≈
Negation-1,111,303
Reciprocal8.99844597 × 10^-7≈
Representations
Decimal1,111,303
Binary10000111101010000011121 bits
Octal4172407
Hexadecimal10F507
Base 36NTHJ
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, one hundred and eleven thousand, three hundred and three
Ordinalone million, one hundred and eleven thousand, three hundred and third
Scientific notation1.111303 × 10^6
Engineering notation1.111303 × 10^6
In other bases
Ternary2002110102101base 3; the most digit-efficient integer base after e: 13 digits
Quinary241030203base 5; one hand: 9 digits
Septenary12305644base 7: 8 digits
Nonary2073371base 9; each digit is two ternary digits: 7 digits
Duodecimal457147base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal6ii53base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal5:8:41:43base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T01T11011T101digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100010011010100011011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100001111010100000111
Bit length21 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits11within that length
Bit parityeven10 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
Bytes310 f5 07
Gray code110001000111110000100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100001111010100000111
64-bit0000000000000000000000000000000000000000000100001111010100000111
One's complement11111111111011110000101011111000at 32 bits, every bit flipped
Bits reversed11100000101011110000100000000000at 32 bits
Rotated left by 100000000001000011110101000001110at 32 bits, wrapping
Shifted left by 11000011110101000001110= 2,222,606, no wrap
Shifted right by 110000111101010000011= 555,651, discarding the low bit
These bits as a double5.49056634 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,111,303 to the power 21,234,994,357,809
1,111,303 to the power 31,372,452,934,816,215,127
1,111,303 to the power 41,525,211,063,820,064,319,280,481
1,111,303 to the power 51,694,971,630,856,428,938,209,356,376,743
First ten multiples1,111,303, 2,222,606, 3,333,909, 4,445,212, 5,556,515, 6,667,818, 7,779,121, 8,890,424, 10,001,727, 11,113,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 4
Divisible by 8No, remainder 7
Divisible by 9No, remainder 1
Divisible by 10No, remainder 3
Divisible by 11No, remainder 6
Divisible by 12No, remainder 7
Divisible by 100No, remainder 3
Collatz (3n + 1) trajectory
Steps to reach 1116the total stopping time
Highest value reached7,501,3006× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,111,303 → 3,333,910 → 1,666,955 → 5,000,866 → 2,500,433 → 7,501,300 → 3,750,650 → 1,875,325 → 5,625,976 → 2,812,988 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage111,130,300%
1,111,303% as a decimal11,113.03
1,111,303% of 1001,111,303
1,111,303% of 1,00011,113,030
As a fraction of 1001,111,303/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,111,303
Nerdulate something else
Nothing in mind? Surprise me · today’s page