Recognised as Number

80,191

Positive
Odd
Prime
5 digits

80,191 is an odd 5-digit integer and a prime number. It has 2 divisors and a digital root of 1.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value80,191

Digit count5

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 numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation80,191

Distinct prime factors180,191

Number of divisors2

Sum of divisors σ(n)80,192

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)80,190the smallest exponent with aˣ ≡ 1 for every unit coprime to n

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

SquarefreeYesno repeated prime factor

All divisors1, 80,1912 in total

Arithmetic

Previous number80,190

Next number80,192

Double160,382

Half40,095.5

Square6,430,596,481

Cube515,675,962,407,871

Square root283.180154672≈irrational, shown to 9 decimal places

Cube root43.122957965≈

Negation-80,191

Reciprocal0.0000124702≈

Representations

Decimal80,191

Binary1001110010011111117 bits

Octal234477

Hexadecimal1393F

Base 361PVJ

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

In wordseighty thousand, one hundred and ninety-one

Ordinaleighty thousand, one hundred and ninety-first

Scientific notation8.0191 × 10^4

Engineering notation80.191 × 10^3

In other bases

Ternary11002000001base 3; the most digit-efficient integer base after e: 11 digits

Quinary10031231base 5; one hand: 8 digits

Septenary452536base 7: 6 digits

Nonary132001base 9; each digit is two ternary digits: 6 digits

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

Vigesimala09bbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits

Sexagesimal22:16:31base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

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

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

Bit-level

00000000000000010011100100111111

Bit length17 bitsto write the magnitude

Set bits11the population count, or Hamming weight

Zero bits6within that length

Bit parityodd11 set bits, so odd; not the same as the number itself being odd

Highest set bitbit 16worth 65,536

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes301 39 3f

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

At each machine width

32-bit00000000000000010011100100111111

64-bit0000000000000000000000000000000000000000000000010011100100111111

One's complement11111111111111101100011011000000at 32 bits, every bit flipped

Bits reversed11111100100111001000000000000000at 32 bits

Rotated left by 100000000000000100111001001111110at 32 bits, wrapping

Shifted left by 1100111001001111110= 160,382, no wrap

Shifted right by 11001110010011111= 40,095, discarding the low bit

These bits as a double3.96196182 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime80,207+16

Previous prime80,177−14

Distance to nearest prime0, it is prime

Nearest square below80,089

Nearest square above80,656

Powers & multiples

80,191 to the power 26,430,596,481

80,191 to the power 3515,675,962,407,871

80,191 to the power 441,352,571,101,449,583,361

80,191 to the power 53,316,104,029,196,343,539,301,951

First ten multiples80,191, 160,382, 240,573, 320,764, 400,955, 481,146, 561,337, 641,528, 721,719, 801,910

Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 1

Divisible by 4No, remainder 3

Divisible by 5No, remainder 1

Divisible by 6No, remainder 1

Divisible by 7No, remainder 6

Divisible by 8No, remainder 7

Divisible by 9No, remainder 1

Divisible by 10No, remainder 1

Divisible by 11No, remainder 1

Divisible by 12No, remainder 7

Divisible by 100No, remainder 91

Collatz (3n + 1) trajectory

Steps to reach 1213the total stopping time

Highest value reached1,826,87222× the starting value

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

First steps80,191 → 240,574 → 120,287 → 360,862 → 180,431 → 541,294 → 270,647 → 811,942 → 405,971 → 1,217,914 → …

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

As a percentage & fraction

As a percentage8,019,100%

80,191% as a decimal801.91

80,191% of 10080,191

80,191% of 1,000801,910

As a fraction of 10080,191/100

Read another way

As seconds22 hours, 16 minutes and 31 seconds

As bytes78.312 KiB

As a 24-bit colour#01393F

Keep nerding

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