Recognised as Number

85,513

Positive
Odd
Prime
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value85,513

Digit count5

Digit sum22

Digit product600

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

Digital root4repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation85,513

Distinct prime factors185,513

Number of divisors2

Sum of divisors σ(n)85,514

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)85,512the smallest exponent with aˣ ≡ 1 for every unit coprime to n

Möbius function μ(n)−11 distinct prime factor, an odd number of them

SquarefreeYesno repeated prime factor

All divisors1, 85,5132 in total

Arithmetic

Previous number85,512

Next number85,514

Double171,026

Half42,756.5

Square7,312,473,169

Cube625,311,518,100,697

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

Cube root44.056573235≈

Negation-85,513

Reciprocal0.0000116941≈

Representations

Decimal85,513

Binary1010011100000100117 bits

Octal247011

Hexadecimal14E09

Base 361TZD

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

In wordseighty-five thousand, five hundred and thirteen

Ordinaleighty-five thousand, five hundred and thirteenth

Scientific notation8.5513 × 10^4

Engineering notation85.513 × 10^3

In other bases

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

Quinary10214023base 5; one hand: 8 digits

Septenary504211base 7: 6 digits

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

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

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

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

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

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

Bit-level

00000000000000010100111000001001

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 4e 09

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

At each machine width

32-bit00000000000000010100111000001001

64-bit0000000000000000000000000000000000000000000000010100111000001001

One's complement11111111111111101011000111110110at 32 bits, every bit flipped

Bits reversed10010000011100101000000000000000at 32 bits

Rotated left by 100000000000000101001110000010010at 32 bits, wrapping

Shifted left by 1101001110000010010= 171,026, no wrap

Shifted right by 11010011100000100= 42,756, discarding the low bit

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

Nearest landmarks

Next prime85,517+4

Previous prime85,487−26

Distance to nearest prime0, it is prime

Nearest square below85,264

Nearest square above85,849

Powers & multiples

85,513 to the power 27,312,473,169

85,513 to the power 3625,311,518,100,697

85,513 to the power 453,472,263,847,344,902,561

85,513 to the power 54,572,573,698,378,004,652,698,793

First ten multiples85,513, 171,026, 256,539, 342,052, 427,565, 513,078, 598,591, 684,104, 769,617, 855,130

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

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 1

Divisible by 4No, remainder 1

Divisible by 5No, remainder 3

Divisible by 6No, remainder 1

Divisible by 7No, remainder 1

Divisible by 8No, remainder 1

Divisible by 9No, remainder 4

Divisible by 10No, remainder 3

Divisible by 11No, remainder 10

Divisible by 12No, remainder 1

Divisible by 100No, remainder 13

Collatz (3n + 1) trajectory

Steps to reach 150the total stopping time

Highest value reached432,9165× the starting value

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

First steps85,513 → 256,540 → 128,270 → 64,135 → 192,406 → 96,203 → 288,610 → 144,305 → 432,916 → 216,458 → …

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

As a percentage & fraction

As a percentage8,551,300%

85,513% as a decimal855.13

85,513% of 10085,513

85,513% of 1,000855,130

As a fraction of 10085,513/100

Read another way

As seconds23 hours, 45 minutes and 13 seconds

As bytes83.509 KiB

As a 24-bit colour#014E09

Keep nerding

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