Recognised as Number
1,111,362
- Positive
- Even
- Composite
- 7 digits
1,111,362 is an even 7-digit integer and a composite number. It has 32 divisors and a digital root of 6.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,111,362
Digit count7
Digit sum15
Digit product36
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root6repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2 × 3 × 7 × 47 × 563
Distinct prime factors52, 3, 7, 47, 563
Number of divisors32
Sum of divisors σ(n)2,598,912
Aliquot sum1,487,550sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)310,224integers below n that share no factor with it
Carmichael function λ(n)38,778the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 310,224
Möbius function μ(n)−15 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 3, 6, 7, 14, 21, 42, 47, 94, 141, 282, 329, 563, 658, 987, 1,126, 1,689, 1,974, 3,378, 3,941, 7,882, 11,823, 23,646, 26,461, 52,922, 79,383, 158,766, 185,227, 370,454, 555,681, 1,111,36232 in total
Arithmetic
Previous number1,111,361
Next number1,111,363
Double2,222,724
Half555,681
Square1,235,125,495,044
Cube1,372,671,540,423,089,928
Square root1,054.211553722≈irrational, shown to 9 decimal places
Cube root103.58221198≈
Negation-1,111,362
Reciprocal8.99796826 × 10^-7≈
Representations
Decimal1,111,362
Binary10000111101010100001021 bits
Octal4172502
Hexadecimal10F542
Base 36NTJ6
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, one hundred and eleven thousand, three hundred and sixty-two
Ordinalone million, one hundred and eleven thousand, three hundred and sixty-second
Scientific notation1.111362 × 10^6
Engineering notation1.111362 × 10^6
In other bases
Ternary2002110111120base 3; the most digit-efficient integer base after e: 13 digits
Quinary241030422base 5; one hand: 9 digits
Septenary12306060base 7: 8 digits
Nonary2073446base 9; each digit is two ternary digits: 7 digits
Duodecimal457196base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal6ii82base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal5:8:42:42base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T01T111TTTTT0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100010011010101000110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100001111010101000010
Bit length21 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits12within that length
Bit parityodd9 set bits, so odd; not the same as the number itself being even
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes310 f5 42
Gray code110001000111111100011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100001111010101000010
64-bit0000000000000000000000000000000000000000000100001111010101000010
One's complement11111111111011110000101010111101at 32 bits, every bit flipped
Bits reversed01000010101011110000100000000000at 32 bits
Rotated left by 100000000001000011110101010000100at 32 bits, wrapping
Shifted left by 11000011110101010000100= 2,222,724, no wrap
Shifted right by 110000111101010100001= 555,681, discarding the low bit
These bits as a double5.49085784 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,111,362 to the power 21,235,125,495,044
1,111,362 to the power 31,372,671,540,423,089,928
1,111,362 to the power 41,525,534,988,507,686,068,561,936
1,111,362 to the power 51,695,421,615,897,879,004,529,130,316,832
First ten multiples1,111,362, 2,222,724, 3,334,086, 4,445,448, 5,556,810, 6,668,172, 7,779,534, 8,890,896, 10,002,258, 11,113,620
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2Yes
Divisible by 3Yes
Divisible by 4No, remainder 2
Divisible by 5No, remainder 2
Divisible by 6Yes
Divisible by 7Yes
Divisible by 8No, remainder 2
Divisible by 9No, remainder 6
Divisible by 10No, remainder 2
Divisible by 11No, remainder 10
Divisible by 12No, remainder 6
Divisible by 100No, remainder 62
Collatz (3n + 1) trajectory
Steps to reach 1139the total stopping time
Highest value reached4,005,4483× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,111,362 → 555,681 → 1,667,044 → 833,522 → 416,761 → 1,250,284 → 625,142 → 312,571 → 937,714 → 468,857 → …
Last steps… → 32 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage111,136,200%
1,111,362% as a decimal11,113.62
1,111,362% of 1001,111,362
1,111,362% of 1,00011,113,620
As a fraction of 1001,111,362/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,362
Nerdulate something else
Nothing in mind? Surprise me · today’s page