Recognised as Number
1,191,997
- Positive
- Odd
- Composite
- 7 digits
1,191,997 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,191,997
Digit count7
Digit sum37
Digit product5,103
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation67 × 17,791
Distinct prime factors267, 17,791
Number of divisors4
Sum of divisors σ(n)1,209,856
Aliquot sum17,859sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,174,140integers below n that share no factor with it
Carmichael function λ(n)195,690the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,174,140
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 67, 17,791, 1,191,9974 in total
Arithmetic
Previous number1,191,996
Next number1,191,998
Double2,383,994
Half595,998.5
Square1,420,856,848,009
Cube1,693,657,100,256,183,973
Square root1,091.786151222≈irrational, shown to 9 decimal places
Cube root106.029094897≈
Negation-1,191,997
Reciprocal8.38928286 × 10^-7≈
Representations
Decimal1,191,997
Binary10010001100000011110121 bits
Octal4430075
Hexadecimal12303D
Base 36PJR1
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, one hundred and ninety-one thousand, nine hundred and ninety-seven
Ordinalone million, one hundred and ninety-one thousand, nine hundred and ninety-seventh
Scientific notation1.191997 × 10^6
Engineering notation1.191997 × 10^6
In other bases
Ternary2020120010001base 3; the most digit-efficient integer base after e: 13 digits
Quinary301120442base 5; one hand: 9 digits
Septenary13063132base 7: 8 digits
Nonary2216101base 9; each digit is two ternary digits: 7 digits
Duodecimal495991base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal78jjhbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal5:31:6:37base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1T1TT0010001digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101100111000001001101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100100011000000111101
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
Bytes312 30 3d
Gray code110110010100000100011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100100011000000111101
64-bit0000000000000000000000000000000000000000000100100011000000111101
One's complement11111111111011011100111111000010at 32 bits, every bit flipped
Bits reversed10111100000011000100100000000000at 32 bits
Rotated left by 100000000001001000110000001111010at 32 bits, wrapping
Shifted left by 11001000110000001111010= 2,383,994, no wrap
Shifted right by 110010001100000011110= 595,998, discarding the low bit
These bits as a double5.88924768 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,191,997 to the power 21,420,856,848,009
1,191,997 to the power 31,693,657,100,256,183,973
1,191,997 to the power 42,018,834,182,534,070,527,264,081
1,191,997 to the power 52,406,444,289,078,064,466,287,202,759,757
First ten multiples1,191,997, 2,383,994, 3,575,991, 4,767,988, 5,959,985, 7,151,982, 8,343,979, 9,535,976, 10,727,973, 11,919,970
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 1
Divisible by 5No, remainder 2
Divisible by 6No, remainder 1
Divisible by 7No, remainder 2
Divisible by 8No, remainder 5
Divisible by 9No, remainder 1
Divisible by 10No, remainder 7
Divisible by 11No, remainder 4
Divisible by 12No, remainder 1
Divisible by 100No, remainder 97
Collatz (3n + 1) trajectory
Steps to reach 198the total stopping time
Highest value reached3,575,9923× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,191,997 → 3,575,992 → 1,787,996 → 893,998 → 446,999 → 1,340,998 → 670,499 → 2,011,498 → 1,005,749 → 3,017,248 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage119,199,700%
1,191,997% as a decimal11,919.97
1,191,997% of 1001,191,997
1,191,997% of 1,00011,919,970
As a fraction of 1001,191,997/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,997
Nerdulate something else
Nothing in mind? Surprise me · today’s page