Recognised as Number
82,977
- Positive
- Odd
- Composite
- 5 digits
82,977 is an odd 5-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 value82,977
Digit count5
Digit sum33
Digit product7,056
Multiplicative persistence2times 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 × 17 × 1,627
Distinct prime factors33, 17, 1,627
Number of divisors8
Sum of divisors σ(n)117,216
Aliquot sum34,239sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)52,032integers below n that share no factor with it
Carmichael function λ(n)13,008the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 52,032
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 3, 17, 51, 1,627, 4,881, 27,659, 82,9778 in total
Arithmetic
Representations
Decimal82,977
Binary1010001000010000117 bits
Octal242041
Hexadecimal14421
Base 361S0X
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordseighty-two thousand, nine hundred and seventy-seven
Ordinaleighty-two thousand, nine hundred and seventy-seventh
Scientific notation8.2977 × 10^4
Engineering notation82.977 × 10^3
In other bases
Ternary11012211020base 3; the most digit-efficient integer base after e: 11 digits
Quinary10123402base 5; one hand: 8 digits
Septenary463626base 7: 6 digits
Nonary135736base 9; each digit is two ternary digits: 6 digits
Duodecimal40029base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimala78hbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal23:2:57base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary111T0T111T0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10100010001100001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000000010100010000100001
Bit length17 bitsto write the magnitude
Set bits5the population count, or Hamming weight
Zero bits12within that length
Bit parityodd5 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 21
Gray code11110011000110001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000000010100010000100001
64-bit0000000000000000000000000000000000000000000000010100010000100001
One's complement11111111111111101011101111011110at 32 bits, every bit flipped
Bits reversed10000100001000101000000000000000at 32 bits
Rotated left by 100000000000000101000100001000010at 32 bits, wrapping
Shifted left by 1101000100001000010= 165,954, no wrap
Shifted right by 11010001000010000= 41,488, discarding the low bit
These bits as a double4.09960851 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
82,977 to the power 26,885,182,529
82,977 to the power 3571,311,790,708,833
82,977 to the power 447,405,738,457,646,835,841
82,977 to the power 53,933,585,960,000,161,497,578,657
First ten multiples82,977, 165,954, 248,931, 331,908, 414,885, 497,862, 580,839, 663,816, 746,793, 829,770
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 1
Divisible by 5No, remainder 2
Divisible by 6No, remainder 3
Divisible by 7No, remainder 6
Divisible by 8No, remainder 1
Divisible by 9No, remainder 6
Divisible by 10No, remainder 7
Divisible by 11No, remainder 4
Divisible by 12No, remainder 9
Divisible by 100No, remainder 77
Collatz (3n + 1) trajectory
Steps to reach 163the total stopping time
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps82,977 → 248,932 → 124,466 → 62,233 → 186,700 → 93,350 → 46,675 → 140,026 → 70,013 → 210,040 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage8,297,700%
82,977% as a decimal829.77
82,977% of 10082,977
82,977% of 1,000829,770
As a fraction of 10082,977/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 82,977
Nerdulate something else
Nothing in mind? Surprise me · today’s page