Recognised as Number
1,121,037
- Positive
- Odd
- Composite
- 7 digits
1,121,037 is an odd 7-digit integer and a composite number. It has 8 divisors and a digital root of 6.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,121,037
Digit count7
Digit sum15
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times 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 factorisation3 × 433 × 863
Distinct prime factors33, 433, 863
Number of divisors8
Sum of divisors σ(n)1,499,904
Aliquot sum378,867sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)744,768integers below n that share no factor with it
Carmichael function λ(n)186,192the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 744,768
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 3, 433, 863, 1,299, 2,589, 373,679, 1,121,0378 in total
Arithmetic
Previous number1,121,036
Next number1,121,038
Double2,242,074
Half560,518.5
Square1,256,723,955,369
Cube1,408,834,052,754,997,653
Square root1,058.790347519≈irrational, shown to 9 decimal places
Cube root103.881923438≈
Negation-1,121,037
Reciprocal8.92031218 × 10^-7≈
Representations
Decimal1,121,037
Binary10001000110110000110121 bits
Octal4215415
Hexadecimal111B0D
Base 36O0ZX
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, one hundred and twenty-one thousand and thirty-seven
Ordinalone million, one hundred and twenty-one thousand and thirty-seventh
Scientific notation1.121037 × 10^6
Engineering notation1.121037 × 10^6
In other bases
Ternary2002221202220base 3; the most digit-efficient integer base after e: 13 digits
Quinary241333122base 5; one hand: 9 digits
Septenary12346221base 7: 8 digits
Nonary2087686base 9; each digit is two ternary digits: 7 digits
Duodecimal4608b9base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal702bhbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal5:11:23:57base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T01000TT100T0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100010110111100011101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100010001101100001101
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 odd
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes311 1b 0d
Gray code110011001011010001011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100010001101100001101
64-bit0000000000000000000000000000000000000000000100010001101100001101
One's complement11111111111011101110010011110010at 32 bits, every bit flipped
Bits reversed10110000110110001000100000000000at 32 bits
Rotated left by 100000000001000100011011000011010at 32 bits, wrapping
Shifted left by 11000100011011000011010= 2,242,074, no wrap
Shifted right by 110001000110110000110= 560,518, discarding the low bit
These bits as a double5.53865869 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,121,037 to the power 21,256,723,955,369
1,121,037 to the power 31,408,834,052,754,997,653
1,121,037 to the power 41,579,355,099,998,304,303,926,161
1,121,037 to the power 51,770,515,503,236,799,061,960,471,748,957
First ten multiples1,121,037, 2,242,074, 3,363,111, 4,484,148, 5,605,185, 6,726,222, 7,847,259, 8,968,296, 10,089,333, 11,210,370
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 1
Divisible by 5No, remainder 2
Divisible by 6No, remainder 3
Divisible by 7No, remainder 1
Divisible by 8No, remainder 5
Divisible by 9No, remainder 6
Divisible by 10No, remainder 7
Divisible by 11No, remainder 5
Divisible by 12No, remainder 9
Divisible by 100No, remainder 37
Collatz (3n + 1) trajectory
Steps to reach 185the total stopping time
Highest value reached3,363,1123× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,121,037 → 3,363,112 → 1,681,556 → 840,778 → 420,389 → 1,261,168 → 630,584 → 315,292 → 157,646 → 78,823 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage112,103,700%
1,121,037% as a decimal11,210.37
1,121,037% of 1001,121,037
1,121,037% of 1,00011,210,370
As a fraction of 1001,121,037/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,121,037
Nerdulate something else
Nothing in mind? Surprise me · today’s page