Recognised as Number

85,013

Positive
Odd
Composite
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value85,013

Digit count5

Digit sum17

Digit product0zero, because one of the digits is zero

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

Digital root8repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation151 × 563

Distinct prime factors2151, 563

Number of divisors4

Sum of divisors σ(n)85,728

Aliquot sum715sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)42,150the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 84,300

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

SquarefreeYesno repeated prime factor

All divisors1, 151, 563, 85,0134 in total

Arithmetic

Previous number85,012

Next number85,014

Double170,026

Half42,506.5

Square7,227,210,169

Cube614,406,818,097,197

Square root291.569888706≈irrational, shown to 9 decimal places

Cube root43.970538128≈

Negation-85,013

Reciprocal0.0000117629≈

Representations

Decimal85,013

Binary1010011000001010117 bits

Octal246025

Hexadecimal14C15

Base 361TLH

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

In wordseighty-five thousand and thirteen

Ordinaleighty-five thousand and thirteenth

Scientific notation8.5013 × 10^4

Engineering notation85.013 × 10^3

In other bases

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

Quinary10210023base 5; one hand: 8 digits

Septenary502565base 7: 6 digits

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

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

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

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

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

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

Bit-level

00000000000000010100110000010101

Bit length17 bitsto write the magnitude

Set bits7the population count, or Hamming weight

Zero bits10within that length

Bit parityodd7 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 4c 15

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

At each machine width

32-bit00000000000000010100110000010101

64-bit0000000000000000000000000000000000000000000000010100110000010101

One's complement11111111111111101011001111101010at 32 bits, every bit flipped

Bits reversed10101000001100101000000000000000at 32 bits

Rotated left by 100000000000000101001100000101010at 32 bits, wrapping

Shifted left by 1101001100000101010= 170,026, no wrap

Shifted right by 11010011000001010= 42,506, discarding the low bit

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

Nearest landmarks

Next prime85,021+8

Previous prime85,009−4

Distance to nearest prime4

Nearest square below84,681

Nearest square above85,264

Powers & multiples

85,013 to the power 27,227,210,169

85,013 to the power 3614,406,818,097,197

85,013 to the power 452,232,566,826,897,008,561

85,013 to the power 54,440,447,203,654,995,388,796,293

First ten multiples85,013, 170,026, 255,039, 340,052, 425,065, 510,078, 595,091, 680,104, 765,117, 850,130

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 1

Divisible by 5No, remainder 3

Divisible by 6No, remainder 5

Divisible by 7No, remainder 5

Divisible by 8No, remainder 5

Divisible by 9No, remainder 8

Divisible by 10No, remainder 3

Divisible by 11No, remainder 5

Divisible by 12No, remainder 5

Divisible by 100No, remainder 13

Collatz (3n + 1) trajectory

Steps to reach 158the total stopping time

Highest value reached255,0403× the starting value

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

First steps85,013 → 255,040 → 127,520 → 63,760 → 31,880 → 15,940 → 7,970 → 3,985 → 11,956 → 5,978 → …

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

As a percentage & fraction

As a percentage8,501,300%

85,013% as a decimal850.13

85,013% of 10085,013

85,013% of 1,000850,130

As a fraction of 10085,013/100

Read another way

As seconds23 hours, 36 minutes and 53 seconds

As bytes83.021 KiB

As a 24-bit colour#014C15

Keep nerding

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