Recognised as Number
1,119,007
- Positive
- Odd
- Composite
- 7 digits
1,119,007 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,119,007
Digit count7
Digit sum19
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 numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation31 × 36,097
Distinct prime factors231, 36,097
Number of divisors4
Sum of divisors σ(n)1,155,136
Aliquot sum36,129sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,082,880integers below n that share no factor with it
Carmichael function λ(n)180,480the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,082,880
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 31, 36,097, 1,119,0074 in total
Arithmetic
Previous number1,119,006
Next number1,119,008
Double2,238,014
Half559,503.5
Square1,252,176,666,049
Cube1,401,194,454,545,493,343
Square root1,057.83127199≈irrational, shown to 9 decimal places
Cube root103.819181613≈
Negation-1,119,007
Reciprocal8.93649459 × 10^-7≈
Representations
Decimal1,119,007
Binary10001000100110001111121 bits
Octal4211437
Hexadecimal11131F
Base 36NZFJ
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, one hundred and nineteen thousand and seven
Ordinalone million, one hundred and nineteen thousand and seventh
Scientific notation1.119007 × 10^6
Engineering notation1.119007 × 10^6
In other bases
Ternary2002211222201base 3; the most digit-efficient integer base after e: 13 digits
Quinary241302012base 5; one hand: 9 digits
Septenary12340261base 7: 8 digits
Nonary2084881base 9; each digit is two ternary digits: 7 digits
Duodecimal45b6a7base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal6jha7base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal5:10:50:7base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0100TT000T01digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100010001011101100011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100010001001100011111
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 odd
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes311 13 1f
Gray code110011001101010010000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100010001001100011111
64-bit0000000000000000000000000000000000000000000100010001001100011111
One's complement11111111111011101110110011100000at 32 bits, every bit flipped
Bits reversed11111000110010001000100000000000at 32 bits
Rotated left by 100000000001000100010011000111110at 32 bits, wrapping
Shifted left by 11000100010011000111110= 2,238,014, no wrap
Shifted right by 110001000100110001111= 559,503, discarding the low bit
These bits as a double5.52862916 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,119,007 to the power 21,252,176,666,049
1,119,007 to the power 31,401,194,454,545,493,343
1,119,007 to the power 41,567,946,402,997,588,869,270,401
1,119,007 to the power 51,754,543,000,579,122,927,835,663,611,807
First ten multiples1,119,007, 2,238,014, 3,357,021, 4,476,028, 5,595,035, 6,714,042, 7,833,049, 8,952,056, 10,071,063, 11,190,070
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 3
Divisible by 5No, remainder 2
Divisible by 6No, remainder 1
Divisible by 7No, remainder 1
Divisible by 8No, remainder 7
Divisible by 9No, remainder 1
Divisible by 10No, remainder 7
Divisible by 11No, remainder 10
Divisible by 12No, remainder 7
Divisible by 100No, remainder 7
Collatz (3n + 1) trajectory
Steps to reach 1134the total stopping time
Highest value reached16,994,93215× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,119,007 → 3,357,022 → 1,678,511 → 5,035,534 → 2,517,767 → 7,553,302 → 3,776,651 → 11,329,954 → 5,664,977 → 16,994,932 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage111,900,700%
1,119,007% as a decimal11,190.07
1,119,007% of 1001,119,007
1,119,007% of 1,00011,190,070
As a fraction of 1001,119,007/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,119,007
Nerdulate something else
Nothing in mind? Surprise me · today’s page