Recognised as Number
83,071
- Positive
- Odd
- Prime
- 5 digits
83,071 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 value83,071
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 factorisation83,071
Distinct prime factors183,071
Number of divisors2
Sum of divisors σ(n)83,072
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)83,070integers below n that share no factor with it
Carmichael function λ(n)83,070the 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, 83,0712 in total
Arithmetic
Representations
Decimal83,071
Binary1010001000111111117 bits
Octal242177
Hexadecimal1447F
Base 361S3J
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordseighty-three thousand and seventy-one
Ordinaleighty-three thousand and seventy-first
Scientific notation8.3071 × 10^4
Engineering notation83.071 × 10^3
In other bases
Ternary11012221201base 3; the most digit-efficient integer base after e: 11 digits
Quinary10124241base 5; one hand: 8 digits
Septenary464122base 7: 6 digits
Nonary135851base 9; each digit is two ternary digits: 6 digits
Duodecimal400a7base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimala7dbbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal23:4:31base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary111T000TT01digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10100010110000011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000000010100010001111111
Bit length17 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits7within that length
Bit parityeven10 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 44 7f
Gray code11110011001000000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000000010100010001111111
64-bit0000000000000000000000000000000000000000000000010100010001111111
One's complement11111111111111101011101110000000at 32 bits, every bit flipped
Bits reversed11111110001000101000000000000000at 32 bits
Rotated left by 100000000000000101000100011111110at 32 bits, wrapping
Shifted left by 1101000100011111110= 166,142, no wrap
Shifted right by 11010001000111111= 41,535, discarding the low bit
These bits as a double4.10425273 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
83,071 to the power 26,900,791,041
83,071 to the power 3573,255,612,566,911
83,071 to the power 447,620,916,991,545,863,681
83,071 to the power 53,955,917,195,404,706,441,844,351
First ten multiples83,071, 166,142, 249,213, 332,284, 415,355, 498,426, 581,497, 664,568, 747,639, 830,710
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 2
Divisible by 8No, remainder 7
Divisible by 9No, remainder 1
Divisible by 10No, remainder 1
Divisible by 11No, remainder 10
Divisible by 12No, remainder 7
Divisible by 100No, remainder 71
Collatz (3n + 1) trajectory
Steps to reach 1226the total stopping time
Highest value reached2,838,72434× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps83,071 → 249,214 → 124,607 → 373,822 → 186,911 → 560,734 → 280,367 → 841,102 → 420,551 → 1,261,654 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage8,307,100%
83,071% as a decimal830.71
83,071% of 10083,071
83,071% of 1,000830,710
As a fraction of 10083,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 83,071
Nerdulate something else
Nothing in mind? Surprise me · today’s page