Recognised as Number

85,367

Positive
Odd
Composite
5 digits

85,367 is an odd 5-digit integer and a composite number. It has 4 divisors and a digital root of 2.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value85,367

Digit count5

Digit sum29

Digit product5,040

Multiplicative persistence2times the digit product can be taken before one digit is left

Digital root2repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation19 × 4,493

Distinct prime factors219, 4,493

Number of divisors4

Sum of divisors σ(n)89,880

Aliquot sum4,513sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)80,856integers below n that share no factor with it

Carmichael function λ(n)40,428the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 80,856

Möbius function μ(n)+12 distinct prime factors, an even number of them

SquarefreeYesno repeated prime factor

All divisors1, 19, 4,493, 85,3674 in total

Arithmetic

Previous number85,366

Next number85,368

Double170,734

Half42,683.5

Square7,287,524,689

Cube622,114,120,125,863

Square root292.176316631≈irrational, shown to 9 decimal places

Cube root44.031485728≈

Negation-85,367

Reciprocal0.0000117141≈

Representations

Decimal85,367

Binary1010011010111011117 bits

Octal246567

Hexadecimal14D77

Base 361TVB

Roman numeralNot defined above 3,999there is no agreed standard notation

In wordseighty-five thousand, three hundred and sixty-seven

Ordinaleighty-five thousand, three hundred and sixty-seventh

Scientific notation8.5367 × 10^4

Engineering notation85.367 × 10^3

In other bases

Ternary11100002202base 3; the most digit-efficient integer base after e: 11 digits

Quinary10212432base 5; one hand: 8 digits

Septenary503612base 7: 6 digits

Nonary140082base 9; each digit is two ternary digits: 6 digits

Duodecimal4149bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits

Vigesimalad87base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits

Sexagesimal23:42:47base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

Balanced ternary11100010T1Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed

Negabinary10101001010001011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000000000010100110101110111

Bit length17 bitsto write the magnitude

Set bits11the population count, or Hamming weight

Zero bits6within that length

Bit parityodd11 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 4d 77

Gray code11110101111001100n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000000000010100110101110111

64-bit0000000000000000000000000000000000000000000000010100110101110111

One's complement11111111111111101011001010001000at 32 bits, every bit flipped

Bits reversed11101110101100101000000000000000at 32 bits

Rotated left by 100000000000000101001101011101110at 32 bits, wrapping

Shifted left by 1101001101011101110= 170,734, no wrap

Shifted right by 11010011010111011= 42,683, discarding the low bit

These bits as a double4.2176902 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime85,369+2

Previous prime85,363−4

Distance to nearest prime2

Nearest square below85,264

Nearest square above85,849

Powers & multiples

85,367 to the power 27,287,524,689

85,367 to the power 3622,114,120,125,863

85,367 to the power 453,108,016,092,784,546,721

85,367 to the power 54,533,672,009,792,738,399,931,607

First ten multiples85,367, 170,734, 256,101, 341,468, 426,835, 512,202, 597,569, 682,936, 768,303, 853,670

Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 2

Divisible by 4No, remainder 3

Divisible by 5No, remainder 2

Divisible by 6No, remainder 5

Divisible by 7No, remainder 2

Divisible by 8No, remainder 7

Divisible by 9No, remainder 2

Divisible by 10No, remainder 7

Divisible by 11No, remainder 7

Divisible by 12No, remainder 11

Divisible by 100No, remainder 67

Collatz (3n + 1) trajectory

Steps to reach 189the total stopping time

Highest value reached576,2326× the starting value

Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven

First steps85,367 → 256,102 → 128,051 → 384,154 → 192,077 → 576,232 → 288,116 → 144,058 → 72,029 → 216,088 → …

Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage8,536,700%

85,367% as a decimal853.67

85,367% of 10085,367

85,367% of 1,000853,670

As a fraction of 10085,367/100

Read another way

As seconds23 hours, 42 minutes and 47 seconds

As bytes83.366 KiB

As a 24-bit colour#014D77

Keep nerding

Every link below is a page Nerdulator can generate from what it already knows about this value.