Recognised as Number
80,147
- Positive
- Odd
- Prime
- 5 digits
80,147 is an odd 5-digit integer and a prime number. It has 2 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value80,147
Digit count5
Digit sum20
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation80,147
Distinct prime factors180,147
Number of divisors2
Sum of divisors σ(n)80,148
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)80,146integers below n that share no factor with it
Carmichael function λ(n)80,146the 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,1472 in total
Arithmetic
Representations
Decimal80,147
Binary1001110010001001117 bits
Octal234423
Hexadecimal13913
Base 361PUB
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordseighty thousand, one hundred and forty-seven
Ordinaleighty thousand, one hundred and forty-seventh
Scientific notation8.0147 × 10^4
Engineering notation80.147 × 10^3
In other bases
Ternary11001221102base 3; the most digit-efficient integer base after e: 11 digits
Quinary10031042base 5; one hand: 8 digits
Septenary452444base 7: 6 digits
Nonary131842base 9; each digit is two ternary digits: 6 digits
Duodecimal3a46bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimala077base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal22:15:47base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1101T0T111Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10100100100010111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000000010011100100010011
Bit length17 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits9within that length
Bit parityeven8 set bits, so even; 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 13
Gray code11010010110011010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000000010011100100010011
64-bit0000000000000000000000000000000000000000000000010011100100010011
One's complement11111111111111101100011011101100at 32 bits, every bit flipped
Bits reversed11001000100111001000000000000000at 32 bits
Rotated left by 100000000000000100111001000100110at 32 bits, wrapping
Shifted left by 1100111001000100110= 160,294, no wrap
Shifted right by 11001110010001001= 40,073, discarding the low bit
These bits as a double3.95978793 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
80,147 to the power 26,423,541,609
80,147 to the power 3514,827,589,336,523
80,147 to the power 441,261,886,802,554,308,881
80,147 to the power 53,307,016,441,564,320,193,885,507
First ten multiples80,147, 160,294, 240,441, 320,588, 400,735, 480,882, 561,029, 641,176, 721,323, 801,470
Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 2
Divisible by 4No, remainder 3
Divisible by 5No, remainder 2
Divisible by 6No, remainder 5
Divisible by 7No, remainder 4
Divisible by 8No, remainder 3
Divisible by 9No, remainder 2
Divisible by 10No, remainder 7
Divisible by 11No, remainder 1
Divisible by 12No, remainder 11
Divisible by 100No, remainder 47
Collatz (3n + 1) trajectory
Steps to reach 1120the total stopping time
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps80,147 → 240,442 → 120,221 → 360,664 → 180,332 → 90,166 → 45,083 → 135,250 → 67,625 → 202,876 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage8,014,700%
80,147% as a decimal801.47
80,147% of 10080,147
80,147% of 1,000801,470
As a fraction of 10080,147/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 80,147
Nerdulate something else
Nothing in mind? Surprise me · today’s page