Recognised as Number
85,504
- Positive
- Even
- Composite
- 5 digits
85,504 is an even 5-digit integer and a composite number. It has 20 divisors and a digital root of 4.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value85,504
Digit count5
Digit sum22
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2^9 × 167
Distinct prime factors22, 167
Number of divisors20
Sum of divisors σ(n)171,864
Aliquot sum86,360sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)42,496integers below n that share no factor with it
Carmichael function λ(n)10,624the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 42,496
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 8, 16, 32, 64, 128, 167, 256, 334, 512, 668, 1,336, 2,672, 5,344, 10,688, 21,376, 42,752, 85,50420 in total
Arithmetic
Representations
Decimal85,504
Binary1010011100000000017 bits
Octal247000
Hexadecimal14E00
Base 361TZ4
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordseighty-five thousand, five hundred and four
Ordinaleighty-five thousand, five hundred and fourth
Scientific notation8.5504 × 10^4
Engineering notation85.504 × 10^3
In other bases
Ternary11100021211base 3; the most digit-efficient integer base after e: 11 digits
Quinary10214004base 5; one hand: 8 digits
Septenary504166base 7: 6 digits
Nonary140254base 9; each digit is two ternary digits: 6 digits
Duodecimal41594base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimaladf4base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal23:45:4base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1110010TT11digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10101001000000000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000000010100111000000000
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 even
Highest set bitbit 16worth 65,536
Lowest set bitbit 99 trailing zeros
Power of twoNo
Bytes301 4e 00
Gray code11110100100000000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000000010100111000000000
64-bit0000000000000000000000000000000000000000000000010100111000000000
One's complement11111111111111101011000111111111at 32 bits, every bit flipped
Bits reversed00000000011100101000000000000000at 32 bits
Rotated left by 100000000000000101001110000000000at 32 bits, wrapping
Shifted left by 1101001110000000000= 171,008, no wrap
Shifted right by 11010011100000000= 42,752, discarding the low bit
These bits as a double4.2244589 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
85,504 to the power 27,310,934,016
85,504 to the power 3625,114,102,104,064
85,504 to the power 453,449,756,186,305,888,256
85,504 to the power 54,570,167,952,953,898,669,441,024
First ten multiples85,504, 171,008, 256,512, 342,016, 427,520, 513,024, 598,528, 684,032, 769,536, 855,040
Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 1
Divisible by 4Yes
Divisible by 5No, remainder 4
Divisible by 6No, remainder 4
Divisible by 7No, remainder 6
Divisible by 8Yes
Divisible by 9No, remainder 4
Divisible by 10No, remainder 4
Divisible by 11No, remainder 1
Divisible by 12No, remainder 4
Divisible by 100No, remainder 4
Collatz (3n + 1) trajectory
Steps to reach 176the total stopping time
Highest value reached85,504
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps85,504 → 42,752 → 21,376 → 10,688 → 5,344 → 2,672 → 1,336 → 668 → 334 → 167 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage8,550,400%
85,504% as a decimal855.04
85,504% of 10085,504
85,504% of 1,000855,040
As a fraction of 10085,504/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 85,504
Nerdulate something else
Nothing in mind? Surprise me · today’s page