Recognised as Number
1,120,150
- Positive
- Even
- Composite
- 7 digits
1,120,150 is an even 7-digit integer and a composite number. It has 24 divisors and a digital root of 1.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,120,150
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 numberYessquared-digit sums reach 1
Harshad numberYesdivisible by its own digit sum
Factors & divisors
Prime factorisation2 × 5^2 × 43 × 521
Distinct prime factors42, 5, 43, 521
Number of divisors24
Sum of divisors σ(n)2,136,024
Aliquot sum1,015,874sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)436,800integers below n that share no factor with it
Carmichael function λ(n)10,920the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 436,800
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 5, 10, 25, 43, 50, 86, 215, 430, 521, 1,042, 1,075, 2,150, 2,605, 5,210, 13,025, 22,403, 26,050, 44,806, 112,015, 224,030, 560,075, 1,120,15024 in total
Arithmetic
Previous number1,120,149
Next number1,120,151
Double2,240,300
Half560,075
Square1,254,736,022,500
Cube1,405,492,555,603,375,000
Square root1,058.371390392≈irrational, shown to 9 decimal places
Cube root103.854517986≈
Negation-1,120,150
Reciprocal8.9273758 × 10^-7≈
Representations
Decimal1,120,150
Binary10001000101111001011021 bits
Octal4213626
Hexadecimal111796
Base 36O0BA
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, one hundred and twenty thousand, one hundred and fifty
Ordinalone million, one hundred and twenty thousand, one hundred and fiftieth
Scientific notation1.12015 × 10^6
Engineering notation1.12015 × 10^6
In other bases
Ternary2002220120001base 3; the most digit-efficient integer base after e: 13 digits
Quinary241321100base 5; one hand: 9 digits
Septenary12343513base 7: 8 digits
Nonary2086501base 9; each digit is two ternary digits: 7 digits
Duodecimal46029abase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal7007abase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal5:11:9:10base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0100T1TT0001digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100010110100011101010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100010001011110010110
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 even
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes311 17 96
Gray code110011001110001011101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100010001011110010110
64-bit0000000000000000000000000000000000000000000100010001011110010110
One's complement11111111111011101110100001101001at 32 bits, every bit flipped
Bits reversed01101001111010001000100000000000at 32 bits
Rotated left by 100000000001000100010111100101100at 32 bits, wrapping
Shifted left by 11000100010111100101100= 2,240,300, no wrap
Shifted right by 110001000101111001011= 560,075, discarding the low bit
These bits as a double5.53427633 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,120,150 to the power 21,254,736,022,500
1,120,150 to the power 31,405,492,555,603,375,000
1,120,150 to the power 41,574,362,486,159,120,506,250,000
1,120,150 to the power 51,763,522,138,871,138,835,075,937,500,000
First ten multiples1,120,150, 2,240,300, 3,360,450, 4,480,600, 5,600,750, 6,720,900, 7,841,050, 8,961,200, 10,081,350, 11,201,500
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 4No, remainder 2
Divisible by 5Yes
Divisible by 6No, remainder 4
Divisible by 7No, remainder 3
Divisible by 8No, remainder 6
Divisible by 9No, remainder 1
Divisible by 10Yes
Divisible by 11No, remainder 9
Divisible by 12No, remainder 10
Divisible by 100No, remainder 50
Collatz (3n + 1) trajectory
Steps to reach 1209the total stopping time
Highest value reached2,520,3402× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,120,150 → 560,075 → 1,680,226 → 840,113 → 2,520,340 → 1,260,170 → 630,085 → 1,890,256 → 945,128 → 472,564 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage112,015,000%
1,120,150% as a decimal11,201.5
1,120,150% of 1001,120,150
1,120,150% of 1,00011,201,500
As a fraction of 1001,120,150/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,150
Nerdulate something else
Nothing in mind? Surprise me · today’s page