Recognised as Number
1,191,999
- Positive
- Odd
- Composite
- 7 digits
1,191,999 is an odd 7-digit integer and a composite number. It has 8 divisors and a digital root of 3.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,191,999
Digit count7
Digit sum39
Digit product6,561
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root3repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3 × 251 × 1,583
Distinct prime factors33, 251, 1,583
Number of divisors8
Sum of divisors σ(n)1,596,672
Aliquot sum404,673sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)791,000integers below n that share no factor with it
Carmichael function λ(n)197,750the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 791,000
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 3, 251, 753, 1,583, 4,749, 397,333, 1,191,9998 in total
Arithmetic
Previous number1,191,998
Next number1,192,000
Double2,383,998
Half595,999.5
Square1,420,861,616,001
Cube1,693,665,625,411,575,999
Square root1,091.787067152≈irrational, shown to 9 decimal places
Cube root106.029154197≈
Negation-1,191,999
Reciprocal8.38926878 × 10^-7≈
Representations
Decimal1,191,999
Binary10010001100000011111121 bits
Octal4430077
Hexadecimal12303F
Base 36PJR3
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, one hundred and ninety-one thousand, nine hundred and ninety-nine
Ordinalone million, one hundred and ninety-one thousand, nine hundred and ninety-ninth
Scientific notation1.191999 × 10^6
Engineering notation1.191999 × 10^6
In other bases
Ternary2020120010010base 3; the most digit-efficient integer base after e: 13 digits
Quinary301120444base 5; one hand: 9 digits
Septenary13063134base 7: 8 digits
Nonary2216103base 9; each digit is two ternary digits: 7 digits
Duodecimal495993base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal78jjjbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal5:31:6:39base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1T1TT0010010digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101100111000001000011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100100011000000111111
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
Bytes312 30 3f
Gray code110110010100000100000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100100011000000111111
64-bit0000000000000000000000000000000000000000000100100011000000111111
One's complement11111111111011011100111111000000at 32 bits, every bit flipped
Bits reversed11111100000011000100100000000000at 32 bits
Rotated left by 100000000001001000110000001111110at 32 bits, wrapping
Shifted left by 11001000110000001111110= 2,383,998, no wrap
Shifted right by 110010001100000011111= 595,999, discarding the low bit
These bits as a double5.88925756 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,191,999 to the power 21,420,861,616,001
1,191,999 to the power 31,693,665,625,411,575,999
1,191,999 to the power 42,018,847,731,824,973,179,232,001
1,191,999 to the power 52,406,464,477,487,636,204,671,365,959,999
First ten multiples1,191,999, 2,383,998, 3,575,997, 4,767,996, 5,959,995, 7,151,994, 8,343,993, 9,535,992, 10,727,991, 11,919,990
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 3
Divisible by 5No, remainder 4
Divisible by 6No, remainder 3
Divisible by 7No, remainder 4
Divisible by 8No, remainder 7
Divisible by 9No, remainder 3
Divisible by 10No, remainder 9
Divisible by 11No, remainder 6
Divisible by 12No, remainder 3
Divisible by 100No, remainder 99
Collatz (3n + 1) trajectory
Steps to reach 1147the total stopping time
Highest value reached27,155,24822× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,191,999 → 3,575,998 → 1,787,999 → 5,363,998 → 2,681,999 → 8,045,998 → 4,022,999 → 12,068,998 → 6,034,499 → 18,103,498 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage119,199,900%
1,191,999% as a decimal11,919.99
1,191,999% of 1001,191,999
1,191,999% of 1,00011,919,990
As a fraction of 1001,191,999/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,191,999
Nerdulate something else
Nothing in mind? Surprise me · today’s page