Recognised as Number

1,147,191

Positive
Odd
Composite
7 digits

1,147,191 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,147,191

Digit count7

Digit sum24

Digit product252

Multiplicative persistence3times 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 × 127 × 3,011

Distinct prime factors33, 127, 3,011

Number of divisors8

Sum of divisors σ(n)1,542,144

Aliquot sum394,953sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)758,520integers below n that share no factor with it

Carmichael function λ(n)27,090the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 758,520

Möbius function μ(n)−13 distinct prime factors, an odd number of them

SquarefreeYesno repeated prime factor

All divisors1, 3, 127, 381, 3,011, 9,033, 382,397, 1,147,1918 in total

Arithmetic

Previous number1,147,190

Next number1,147,192

Double2,294,382

Half573,595.5

Square1,316,047,190,481

Cube1,509,757,492,495,088,871

Square root1,071.070025722≈irrational, shown to 9 decimal places

Cube root104.683582582≈

Negation-1,147,191

Reciprocal8.71694426 × 10^-7≈

Representations

Decimal1,147,191

Binary10001100000010011011121 bits

Octal4300467

Hexadecimal118137

Base 36OL6F

Roman numeralNot defined above 3,999there is no agreed standard notation

In wordsone million, one hundred and forty-seven thousand, one hundred and ninety-one

Ordinalone million, one hundred and forty-seven thousand, one hundred and ninety-first

Scientific notation1.147191 × 10^6

Engineering notation1.147191 × 10^6

In other bases

Ternary2011021122120base 3; the most digit-efficient integer base after e: 13 digits

Quinary243202231base 5; one hand: 9 digits

Septenary12515403base 7: 8 digits

Nonary2137576base 9; each digit is two ternary digits: 7 digits

Duodecimal473a73base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits

Vigesimal737jbbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits

Sexagesimal5:18:39:51base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

Balanced ternary1T01110TT00TT0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed

Negabinary101101000000101001011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000000100011000000100110111

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 81 37

Gray code110010100000110101100n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000000100011000000100110111

64-bit0000000000000000000000000000000000000000000100011000000100110111

One's complement11111111111011100111111011001000at 32 bits, every bit flipped

Bits reversed11101100100000011000100000000000at 32 bits

Rotated left by 100000000001000110000001001101110at 32 bits, wrapping

Shifted left by 11000110000001001101110= 2,294,382, no wrap

Shifted right by 110001100000010011011= 573,595, discarding the low bit

These bits as a double5.66787662 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime1,147,193+2

Previous prime1,147,189−2

Distance to nearest prime2

Nearest square below1,147,041

Nearest square above1,149,184

Powers & multiples

1,147,191 to the power 21,316,047,190,481

1,147,191 to the power 31,509,757,492,495,088,871

1,147,191 to the power 41,731,980,207,572,933,497,011,361

1,147,191 to the power 51,986,912,106,305,801,151,369,960,236,951

First ten multiples1,147,191, 2,294,382, 3,441,573, 4,588,764, 5,735,955, 6,883,146, 8,030,337, 9,177,528, 10,324,719, 11,471,910

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 1

Divisible by 6No, remainder 3

Divisible by 7No, remainder 3

Divisible by 8No, remainder 7

Divisible by 9No, remainder 6

Divisible by 10No, remainder 1

Divisible by 11No, remainder 1

Divisible by 12No, remainder 3

Divisible by 100No, remainder 91

Collatz (3n + 1) trajectory

Steps to reach 1191the total stopping time

Highest value reached7,743,5446× the starting value

Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven

First steps1,147,191 → 3,441,574 → 1,720,787 → 5,162,362 → 2,581,181 → 7,743,544 → 3,871,772 → 1,935,886 → 967,943 → 2,903,830 → …

Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage114,719,100%

1,147,191% as a decimal11,471.91

1,147,191% of 1001,147,191

1,147,191% of 1,00011,471,910

As a fraction of 1001,147,191/100

Read another way

As seconds13 days, 6 hours and 39 minutes

As bytes1.094 MiB

As a 24-bit colour#118137

Keep nerding

Every link below is a page Nerdulator can generate from what it already knows about this value.