Recognised as Number
81,204
- Positive
- Even
- Composite
- 5 digits
81,204 is an even 5-digit integer and a composite number. It has 24 divisors and a digital root of 6.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value81,204
Digit count5
Digit sum15
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times 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 factorisation2^2 × 3 × 67 × 101
Distinct prime factors42, 3, 67, 101
Number of divisors24
Sum of divisors σ(n)194,208
Aliquot sum113,004sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)26,400integers below n that share no factor with it
Carmichael function λ(n)3,300the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 26,400
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 3, 4, 6, 12, 67, 101, 134, 201, 202, 268, 303, 402, 404, 606, 804, 1,212, 6,767, 13,534, 20,301, 27,068, 40,602, 81,20424 in total
Arithmetic
Representations
Decimal81,204
Binary1001111010011010017 bits
Octal236464
Hexadecimal13D34
Base 361QNO
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordseighty-one thousand, two hundred and four
Ordinaleighty-one thousand, two hundred and fourth
Scientific notation8.1204 × 10^4
Engineering notation81.204 × 10^3
In other bases
Ternary11010101120base 3; the most digit-efficient integer base after e: 11 digits
Quinary10044304base 5; one hand: 8 digits
Septenary455514base 7: 6 digits
Nonary133346base 9; each digit is two ternary digits: 6 digits
Duodecimal3abb0base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimala304base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal22:33:24base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1101011TTT0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10100110101110100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000000010011110100110100
Bit length17 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits8within that length
Bit parityodd9 set bits, so odd; not the same as the number itself being even
Highest set bitbit 16worth 65,536
Lowest set bitbit 22 trailing zeros
Power of twoNo
Bytes301 3d 34
Gray code11010001110101110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000000010011110100110100
64-bit0000000000000000000000000000000000000000000000010011110100110100
One's complement11111111111111101100001011001011at 32 bits, every bit flipped
Bits reversed00101100101111001000000000000000at 32 bits
Rotated left by 100000000000000100111101001101000at 32 bits, wrapping
Shifted left by 1100111101001101000= 162,408, no wrap
Shifted right by 11001111010011010= 40,602, discarding the low bit
These bits as a double4.01201067 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
81,204 to the power 26,594,089,616
81,204 to the power 3535,466,453,177,664
81,204 to the power 443,482,017,863,839,027,456
81,204 to the power 53,530,913,778,615,184,385,537,024
First ten multiples81,204, 162,408, 243,612, 324,816, 406,020, 487,224, 568,428, 649,632, 730,836, 812,040
Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)
Divisibility tests
Divisible by 2Yes
Divisible by 3Yes
Divisible by 4Yes
Divisible by 5No, remainder 4
Divisible by 6Yes
Divisible by 7No, remainder 4
Divisible by 8No, remainder 4
Divisible by 9No, remainder 6
Divisible by 10No, remainder 4
Divisible by 11No, remainder 2
Divisible by 12Yes
Divisible by 100No, remainder 4
Collatz (3n + 1) trajectory
Steps to reach 1138the total stopping time
Highest value reached81,204
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps81,204 → 40,602 → 20,301 → 60,904 → 30,452 → 15,226 → 7,613 → 22,840 → 11,420 → 5,710 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage8,120,400%
81,204% as a decimal812.04
81,204% of 10081,204
81,204% of 1,000812,040
As a fraction of 10081,204/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 81,204
Nerdulate something else
Nothing in mind? Surprise me · today’s page