Recognised as Number
1,120,958
- Positive
- Even
- Composite
- 7 digits
1,120,958 is an even 7-digit integer and a composite number. It has 4 divisors and a digital root of 8.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,120,958
Digit count7
Digit sum26
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2 × 560,479
Distinct prime factors22, 560,479
Number of divisors4
Sum of divisors σ(n)1,681,440
Aliquot sum560,482sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)560,478integers below n that share no factor with it
Carmichael function λ(n)560,478the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 560,479, 1,120,9584 in total
Arithmetic
Previous number1,120,957
Next number1,120,959
Double2,241,916
Half560,479
Square1,256,546,837,764
Cube1,408,536,230,166,257,912
Square root1,058.753040137≈irrational, shown to 9 decimal places
Cube root103.879483178≈
Negation-1,120,958
Reciprocal8.92094084 × 10^-7≈
Representations
Decimal1,120,958
Binary10001000110101011111021 bits
Octal4215276
Hexadecimal111ABE
Base 36O0XQ
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, one hundred and twenty thousand, nine hundred and fifty-eight
Ordinalone million, one hundred and twenty thousand, nine hundred and fifty-eighth
Scientific notation1.120958 × 10^6
Engineering notation1.120958 × 10^6
In other bases
Ternary2002221122222base 3; the most digit-efficient integer base after e: 13 digits
Quinary241332313base 5; one hand: 9 digits
Septenary12346046base 7: 8 digits
Nonary2087588base 9; each digit is two ternary digits: 7 digits
Duodecimal460852base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal7027ibase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal5:11:22:38base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T01000TT0000Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100010110111111000010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100010001101010111110
Bit length21 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits10within that length
Bit parityodd11 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
Bytes311 1a be
Gray code110011001011111100001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100010001101010111110
64-bit0000000000000000000000000000000000000000000100010001101010111110
One's complement11111111111011101110010101000001at 32 bits, every bit flipped
Bits reversed01111101010110001000100000000000at 32 bits
Rotated left by 100000000001000100011010101111100at 32 bits, wrapping
Shifted left by 11000100011010101111100= 2,241,916, no wrap
Shifted right by 110001000110101011111= 560,479, discarding the low bit
These bits as a double5.53826838 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,120,958 to the power 21,256,546,837,764
1,120,958 to the power 31,408,536,230,166,257,912
1,120,958 to the power 41,578,909,955,494,708,136,519,696
1,120,958 to the power 51,769,891,745,891,437,043,296,845,388,768
First ten multiples1,120,958, 2,241,916, 3,362,874, 4,483,832, 5,604,790, 6,725,748, 7,846,706, 8,967,664, 10,088,622, 11,209,580
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 2
Divisible by 4No, remainder 2
Divisible by 5No, remainder 3
Divisible by 6No, remainder 2
Divisible by 7No, remainder 6
Divisible by 8No, remainder 6
Divisible by 9No, remainder 8
Divisible by 10No, remainder 8
Divisible by 11No, remainder 3
Divisible by 12No, remainder 2
Divisible by 100No, remainder 58
Collatz (3n + 1) trajectory
Steps to reach 1134the total stopping time
Highest value reached8,512,2887× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,120,958 → 560,479 → 1,681,438 → 840,719 → 2,522,158 → 1,261,079 → 3,783,238 → 1,891,619 → 5,674,858 → 2,837,429 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage112,095,800%
1,120,958% as a decimal11,209.58
1,120,958% of 1001,120,958
1,120,958% of 1,00011,209,580
As a fraction of 1001,120,958/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,120,958
Nerdulate something else
Nothing in mind? Surprise me · today’s page