Recognised as Number
83,091
- Positive
- Odd
- Composite
- 5 digits
83,091 is an odd 5-digit integer and a composite number. It has 4 divisors and a digital root of 3.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value83,091
Digit count5
Digit sum21
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root3repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3 × 27,697
Distinct prime factors23, 27,697
Number of divisors4
Sum of divisors σ(n)110,792
Aliquot sum27,701sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)55,392integers below n that share no factor with it
Carmichael function λ(n)27,696the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 55,392
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 3, 27,697, 83,0914 in total
Arithmetic
Representations
Decimal83,091
Binary1010001001001001117 bits
Octal242223
Hexadecimal14493
Base 361S43
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordseighty-three thousand and ninety-one
Ordinaleighty-three thousand and ninety-first
Scientific notation8.3091 × 10^4
Engineering notation83.091 × 10^3
In other bases
Ternary11012222110base 3; the most digit-efficient integer base after e: 11 digits
Quinary10124331base 5; one hand: 8 digits
Septenary464151base 7: 6 digits
Nonary135873base 9; each digit is two ternary digits: 6 digits
Duodecimal40103base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimala7ebbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal23:4:51base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary111T000T110digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10100010110010111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000000010100010010010011
Bit length17 bitsto write the magnitude
Set bits7the population count, or Hamming weight
Zero bits10within that length
Bit parityodd7 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 44 93
Gray code11110011011011010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000000010100010010010011
64-bit0000000000000000000000000000000000000000000000010100010010010011
One's complement11111111111111101011101101101100at 32 bits, every bit flipped
Bits reversed11001001001000101000000000000000at 32 bits
Rotated left by 100000000000000101000100100100110at 32 bits, wrapping
Shifted left by 1101000100100100110= 166,182, no wrap
Shifted right by 11010001001001001= 41,545, discarding the low bit
These bits as a double4.10524086 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
83,091 to the power 26,904,114,281
83,091 to the power 3573,669,759,722,571
83,091 to the power 447,666,794,005,108,146,961
83,091 to the power 53,960,681,580,678,441,039,136,451
First ten multiples83,091, 166,182, 249,273, 332,364, 415,455, 498,546, 581,637, 664,728, 747,819, 830,910
Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)
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 1
Divisible by 8No, remainder 3
Divisible by 9No, remainder 3
Divisible by 10No, remainder 1
Divisible by 11No, remainder 8
Divisible by 12No, remainder 3
Divisible by 100No, remainder 91
Collatz (3n + 1) trajectory
Steps to reach 158the total stopping time
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps83,091 → 249,274 → 124,637 → 373,912 → 186,956 → 93,478 → 46,739 → 140,218 → 70,109 → 210,328 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage8,309,100%
83,091% as a decimal830.91
83,091% of 10083,091
83,091% of 1,000830,910
As a fraction of 10083,091/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,091
Nerdulate something else
Nothing in mind? Surprise me · today’s page