Recognised as Number
82,494
- Positive
- Even
- Composite
- 5 digits
82,494 is an even 5-digit integer and a composite number. It has 12 divisors and a digital root of 9.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value82,494
Digit count5
Digit sum27
Digit product2,304
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2 × 3^2 × 4,583
Distinct prime factors32, 3, 4,583
Number of divisors12
Sum of divisors σ(n)178,776
Aliquot sum96,282sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)27,492integers below n that share no factor with it
Carmichael function λ(n)13,746the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 27,492
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 3, 6, 9, 18, 4,583, 9,166, 13,749, 27,498, 41,247, 82,49412 in total
Arithmetic
Representations
Decimal82,494
Binary1010000100011111017 bits
Octal241076
Hexadecimal1423E
Base 361RNI
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordseighty-two thousand, four hundred and ninety-four
Ordinaleighty-two thousand, four hundred and ninety-fourth
Scientific notation8.2494 × 10^4
Engineering notation82.494 × 10^3
In other bases
Ternary11012011100base 3; the most digit-efficient integer base after e: 11 digits
Quinary10114434base 5; one hand: 8 digits
Septenary462336base 7: 6 digits
Nonary135140base 9; each digit is two ternary digits: 6 digits
Duodecimal3b8a6base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimala64ebase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal22:54:54base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary111TT011100digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10100011001000010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000000010100001000111110
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 even
Highest set bitbit 16worth 65,536
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes301 42 3e
Gray code11110001100100001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000000010100001000111110
64-bit0000000000000000000000000000000000000000000000010100001000111110
One's complement11111111111111101011110111000001at 32 bits, every bit flipped
Bits reversed01111100010000101000000000000000at 32 bits
Rotated left by 100000000000000101000010001111100at 32 bits, wrapping
Shifted left by 1101000010001111100= 164,988, no wrap
Shifted right by 11010000100011111= 41,247, discarding the low bit
These bits as a double4.07574514 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
82,494 to the power 26,805,260,036
82,494 to the power 3561,393,121,409,784
82,494 to the power 446,311,564,157,578,721,296
82,494 to the power 53,820,426,173,615,299,034,592,224
First ten multiples82,494, 164,988, 247,482, 329,976, 412,470, 494,964, 577,458, 659,952, 742,446, 824,940
Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)
Divisibility tests
Divisible by 2Yes
Divisible by 3Yes
Divisible by 4No, remainder 2
Divisible by 5No, remainder 4
Divisible by 6Yes
Divisible by 7No, remainder 6
Divisible by 8No, remainder 6
Divisible by 9Yes
Divisible by 10No, remainder 4
Divisible by 11No, remainder 5
Divisible by 12No, remainder 6
Divisible by 100No, remainder 94
Collatz (3n + 1) trajectory
Steps to reach 1151the total stopping time
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps82,494 → 41,247 → 123,742 → 61,871 → 185,614 → 92,807 → 278,422 → 139,211 → 417,634 → 208,817 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage8,249,400%
82,494% as a decimal824.94
82,494% of 10082,494
82,494% of 1,000824,940
As a fraction of 10082,494/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,494
Nerdulate something else
Nothing in mind? Surprise me · today’s page