Recognised as Number
1,122,364
- Positive
- Even
- Composite
- 7 digits
1,122,364 is an even 7-digit integer and a composite number. It has 6 divisors and a digital root of 1.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,122,364
Digit count7
Digit sum19
Digit product288
Multiplicative persistence4times 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 factorisation2^2 × 280,591
Distinct prime factors22, 280,591
Number of divisors6
Sum of divisors σ(n)1,964,144
Aliquot sum841,780sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)561,180integers below n that share no factor with it
Carmichael function λ(n)280,590the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 561,180
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 280,591, 561,182, 1,122,3646 in total
Arithmetic
Previous number1,122,363
Next number1,122,365
Double2,244,728
Half561,182
Square1,259,700,948,496
Cube1,413,842,995,357,764,544
Square root1,059.416820708≈irrational, shown to 9 decimal places
Cube root103.9228965≈
Negation-1,122,364
Reciprocal8.90976546 × 10^-7≈
Representations
Decimal1,122,364
Binary10001001000000011110021 bits
Octal4220074
Hexadecimal11203C
Base 36O20S
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, one hundred and twenty-two thousand, three hundred and sixty-four
Ordinalone million, one hundred and twenty-two thousand, three hundred and sixty-fourth
Scientific notation1.122364 × 10^6
Engineering notation1.122364 × 10^6
In other bases
Ternary2010000121001base 3; the most digit-efficient integer base after e: 13 digits
Quinary241403424base 5; one hand: 9 digits
Septenary12353125base 7: 8 digits
Nonary2100531base 9; each digit is two ternary digits: 7 digits
Duodecimal461624base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal705i4base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal5:11:46:4base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T010001TT1001digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100010110000001001100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100010010000000111100
Bit length21 bitsto write the magnitude
Set bits7the population count, or Hamming weight
Zero bits14within that length
Bit parityodd7 set bits, so odd; not the same as the number itself being even
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 22 trailing zeros
Power of twoNo
Bytes311 20 3c
Gray code110011011000000100010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100010010000000111100
64-bit0000000000000000000000000000000000000000000100010010000000111100
One's complement11111111111011101101111111000011at 32 bits, every bit flipped
Bits reversed00111100000001001000100000000000at 32 bits
Rotated left by 100000000001000100100000001111000at 32 bits, wrapping
Shifted left by 11000100100000001111000= 2,244,728, no wrap
Shifted right by 110001001000000011110= 561,182, discarding the low bit
These bits as a double5.54521495 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,122,364 to the power 21,259,700,948,496
1,122,364 to the power 31,413,842,995,357,764,544
1,122,364 to the power 41,586,846,479,641,722,044,662,016
1,122,364 to the power 51,781,019,362,276,601,720,935,038,925,824
First ten multiples1,122,364, 2,244,728, 3,367,092, 4,489,456, 5,611,820, 6,734,184, 7,856,548, 8,978,912, 10,101,276, 11,223,640
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 1
Divisible by 4Yes
Divisible by 5No, remainder 4
Divisible by 6No, remainder 4
Divisible by 7No, remainder 5
Divisible by 8No, remainder 4
Divisible by 9No, remainder 1
Divisible by 10No, remainder 4
Divisible by 11No, remainder 1
Divisible by 12No, remainder 4
Divisible by 100No, remainder 64
Collatz (3n + 1) trajectory
Steps to reach 185the total stopping time
Highest value reached2,840,9922× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,122,364 → 561,182 → 280,591 → 841,774 → 420,887 → 1,262,662 → 631,331 → 1,893,994 → 946,997 → 2,840,992 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage112,236,400%
1,122,364% as a decimal11,223.64
1,122,364% of 1001,122,364
1,122,364% of 1,00011,223,640
As a fraction of 1001,122,364/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,122,364
Nerdulate something else
Nothing in mind? Surprise me · today’s page