Recognised as Number
1,197,071
- Positive
- Odd
- Composite
- 7 digits
1,197,071 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 8.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,197,071
Digit count7
Digit sum26
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation661 × 1,811
Distinct prime factors2661, 1,811
Number of divisors4
Sum of divisors σ(n)1,199,544
Aliquot sum2,473sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,194,600integers below n that share no factor with it
Carmichael function λ(n)119,460the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,194,600
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 661, 1,811, 1,197,0714 in total
Arithmetic
Previous number1,197,070
Next number1,197,072
Double2,394,142
Half598,535.5
Square1,432,978,979,041
Cube1,715,377,579,419,588,911
Square root1,094.10739875≈irrational, shown to 9 decimal places
Cube root106.179327397≈
Negation-1,197,071
Reciprocal8.35372338 × 10^-7≈
Representations
Decimal1,197,071
Binary10010010001000000111121 bits
Octal4442017
Hexadecimal12440F
Base 36PNNZ
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, one hundred and ninety-seven thousand and seventy-one
Ordinalone million, one hundred and ninety-seven thousand and seventy-first
Scientific notation1.197071 × 10^6
Engineering notation1.197071 × 10^6
In other bases
Ternary2020211001222base 3; the most digit-efficient integer base after e: 13 digits
Quinary301301241base 5; one hand: 9 digits
Septenary13114001base 7: 8 digits
Nonary2224058base 9; each digit is two ternary digits: 7 digits
Duodecimal4988bbbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal79cdbbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal5:32:31:11base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1T1T1101T00Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101100100010000010011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100100100010000001111
Bit length21 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits13within that length
Bit parityeven8 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 44 0f
Gray code110110110011000001000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100100100010000001111
64-bit0000000000000000000000000000000000000000000100100100010000001111
One's complement11111111111011011011101111110000at 32 bits, every bit flipped
Bits reversed11110000001000100100100000000000at 32 bits
Rotated left by 100000000001001001000100000011110at 32 bits, wrapping
Shifted left by 11001001000100000011110= 2,394,142, no wrap
Shifted right by 110010010001000000111= 598,535, discarding the low bit
These bits as a double5.91431657 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,197,071 to the power 21,432,978,979,041
1,197,071 to the power 31,715,377,579,419,588,911
1,197,071 to the power 42,053,428,754,373,386,717,279,681
1,197,071 to the power 52,458,100,012,426,504,411,040,705,014,351
First ten multiples1,197,071, 2,394,142, 3,591,213, 4,788,284, 5,985,355, 7,182,426, 8,379,497, 9,576,568, 10,773,639, 11,970,710
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 2
Divisible by 4No, remainder 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 1
Divisible by 8No, remainder 7
Divisible by 9No, remainder 8
Divisible by 10No, remainder 1
Divisible by 11No, remainder 7
Divisible by 12No, remainder 11
Divisible by 100No, remainder 71
Collatz (3n + 1) trajectory
Steps to reach 1142the total stopping time
Highest value reached12,120,35210× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,197,071 → 3,591,214 → 1,795,607 → 5,386,822 → 2,693,411 → 8,080,234 → 4,040,117 → 12,120,352 → 6,060,176 → 3,030,088 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage119,707,100%
1,197,071% as a decimal11,970.71
1,197,071% of 1001,197,071
1,197,071% of 1,00011,970,710
As a fraction of 1001,197,071/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,197,071
Nerdulate something else
Nothing in mind? Surprise me · today’s page