Nerdulator> put something in

Recognised as Number

85,015

  • Positive
  • Odd
  • Composite
  • 5 digits

85,015 is an odd 5-digit integer and a composite number. It has 12 divisors and a digital root of 1.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value85,015
Digit count5
Digit sum19
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation5 × 7^2 × 347
Distinct prime factors35, 7, 347
Number of divisors12
Sum of divisors σ(n)119,016
Aliquot sum34,001sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)58,128integers below n that share no factor with it
Carmichael function λ(n)14,532the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 58,128
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 5, 7, 35, 49, 245, 347, 1,735, 2,429, 12,145, 17,003, 85,01512 in total

Arithmetic

Previous number85,014
Next number85,016
Double170,030
Square root291.573318395≈irrational, shown to 9 decimal places
Cube root43.97088294≈
Negation-85,015
Reciprocal0.0000117626≈

Representations

Decimal85,015
Binary1010011000001011117 bits
Octal246027
Hexadecimal14C17
Base 361TLJ
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordseighty-five thousand and fifteen
Ordinaleighty-five thousand and fifteenth
Scientific notation8.5015 × 10^4
Engineering notation85.015 × 10^3

In other bases

Ternary11022121201base 3; the most digit-efficient integer base after e: 11 digits
Quinary10210030base 5; one hand: 8 digits
Septenary502600base 7: 6 digits
Nonary138551base 9; each digit is two ternary digits: 6 digits
Duodecimal41247base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalacafbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal23:36:55base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary11100T0TT01digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10101110001101011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000000000010100110000010111
Bit length17 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits9within that length
Bit parityeven8 set bits, so even; 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 17
Gray code11110101000011100n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000000000010100110000010111
64-bit0000000000000000000000000000000000000000000000010100110000010111
One's complement11111111111111101011001111101000at 32 bits, every bit flipped
Bits reversed11101000001100101000000000000000at 32 bits
Rotated left by 100000000000000101001100000101110at 32 bits, wrapping
Shifted left by 1101001100000101110= 170,030, no wrap
Shifted right by 11010011000001011= 42,507, discarding the low bit
These bits as a double4.20029909 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime85,021+6
Previous prime85,009−6
Distance to nearest prime6
Nearest square below84,681
Nearest square above85,264

Powers & multiples

85,015 to the power 27,227,550,225
85,015 to the power 3614,450,182,378,375
85,015 to the power 452,237,482,254,897,550,625
85,015 to the power 54,440,969,553,900,115,266,384,375
First ten multiples85,015, 170,030, 255,045, 340,060, 425,075, 510,090, 595,105, 680,120, 765,135, 850,150
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 3
Divisible by 5Yes
Divisible by 6No, remainder 1
Divisible by 7Yes
Divisible by 8No, remainder 7
Divisible by 9No, remainder 1
Divisible by 10No, remainder 5
Divisible by 11No, remainder 7
Divisible by 12No, remainder 7
Divisible by 100No, remainder 15

Collatz (3n + 1) trajectory

Steps to reach 158the total stopping time
Highest value reached573,8566× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps85,015 → 255,046 → 127,523 → 382,570 → 191,285 → 573,856 → 286,928 → 143,464 → 71,732 → 35,866 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage8,501,500%
85,015% as a decimal850.15
85,015% of 10085,015
85,015% of 1,000850,150
As a fraction of 10085,015/100

Read another way

As bytes83.022 KiB
As a 24-bit colour#014C17

Keep nerding

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

Nerdulate something else

Nothing in mind? Surprise me · today’s page

Every value on this page was computed from “85015” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.