Recognised as Number
1,122,385
- Positive
- Odd
- Composite
- 7 digits
1,122,385 is an odd 7-digit integer and a composite number. It has 8 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,122,385
Digit count7
Digit sum22
Digit product480
Multiplicative persistence2times 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 numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation5 × 11 × 20,407
Distinct prime factors35, 11, 20,407
Number of divisors8
Sum of divisors σ(n)1,469,376
Aliquot sum346,991sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)816,240integers below n that share no factor with it
Carmichael function λ(n)204,060the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 816,240
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 5, 11, 55, 20,407, 102,035, 224,477, 1,122,3858 in total
Arithmetic
Previous number1,122,384
Next number1,122,386
Double2,244,770
Half561,192.5
Square1,259,748,088,225
Cube1,413,922,358,002,416,625
Square root1,059.426731775≈irrational, shown to 9 decimal places
Cube root103.923544646≈
Negation-1,122,385
Reciprocal8.90959876 × 10^-7≈
Representations
Decimal1,122,385
Binary10001001000000101000121 bits
Octal4220121
Hexadecimal112051
Base 36O21D
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, one hundred and twenty-two thousand, three hundred and eighty-five
Ordinalone million, one hundred and twenty-two thousand, three hundred and eighty-fifth
Scientific notation1.122385 × 10^6
Engineering notation1.122385 × 10^6
In other bases
Ternary2010000121211base 3; the most digit-efficient integer base after e: 13 digits
Quinary241404020base 5; one hand: 9 digits
Septenary12353155base 7: 8 digits
Nonary2100554base 9; each digit is two ternary digits: 7 digits
Duodecimal461641base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal705j5base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal5:11:46:25base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T010001T0TT11digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100010110000001010001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100010010000001010001
Bit length21 bitsto write the magnitude
Set bits6the population count, or Hamming weight
Zero bits15within that length
Bit parityeven6 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 20 51
Gray code110011011000001111001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100010010000001010001
64-bit0000000000000000000000000000000000000000000100010010000001010001
One's complement11111111111011101101111110101110at 32 bits, every bit flipped
Bits reversed10001010000001001000100000000000at 32 bits
Rotated left by 100000000001000100100000010100010at 32 bits, wrapping
Shifted left by 11000100100000010100010= 2,244,770, no wrap
Shifted right by 110001001000000101000= 561,192, discarding the low bit
These bits as a double5.5453187 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,122,385 to the power 21,259,748,088,225
1,122,385 to the power 31,413,922,358,002,416,625
1,122,385 to the power 41,586,965,245,786,542,383,650,625
1,122,385 to the power 51,781,185,987,392,128,373,273,706,740,625
First ten multiples1,122,385, 2,244,770, 3,367,155, 4,489,540, 5,611,925, 6,734,310, 7,856,695, 8,979,080, 10,101,465, 11,223,850
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 1
Divisible by 5Yes
Divisible by 6No, remainder 1
Divisible by 7No, remainder 5
Divisible by 8No, remainder 1
Divisible by 9No, remainder 4
Divisible by 10No, remainder 5
Divisible by 11Yes
Divisible by 12No, remainder 1
Divisible by 100No, remainder 85
Collatz (3n + 1) trajectory
Steps to reach 1134the total stopping time
Highest value reached3,367,1563× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,122,385 → 3,367,156 → 1,683,578 → 841,789 → 2,525,368 → 1,262,684 → 631,342 → 315,671 → 947,014 → 473,507 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage112,238,500%
1,122,385% as a decimal11,223.85
1,122,385% of 1001,122,385
1,122,385% of 1,00011,223,850
As a fraction of 1001,122,385/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,385
Nerdulate something else
Nothing in mind? Surprise me · today’s page