Number

80,565

Positive
Odd
Composite
5 digits

80,565 is an odd 5-digit integer and a composite number. It has 16 divisors and a digital root of 6.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value80,565

Digit count5

Digit sum24

Digital root6repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3 × 5 × 41 × 131

Distinct prime factors43, 5, 41, 131

Number of divisors16

Sum of divisors σ(n)133,056

Aliquot sum52,491sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

SquarefreeYesno repeated prime factor

All divisors1, 3, 5, 15, 41, 123, 131, 205, 393, 615, 655, 1,965, 5,371, 16,113, 26,855, 80,56516 in total

Arithmetic

Previous number80,564

Next number80,566

Double161,130

Half40,282.5

Square6,490,719,225

Cube522,924,794,362,125

Square root283.839743517≈irrational, shown to 9 decimal places

Cube root43.189893898≈

Negation-80,565

Reciprocal0.0000124123≈

Representations

Decimal80,565

Binary1001110101011010117 bits

Octal235265

Hexadecimal13AB5

Base 361Q5X

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

In wordseighty thousand, five hundred and sixty-five

Ordinaleighty thousand, five hundred and sixty-fifth

Scientific notation8.0565 × 10^4

Engineering notation80.565 × 10^3

Nearest landmarks

Next prime80,567+2

Previous prime80,557−8

Distance to nearest prime2

Nearest square below80,089

Nearest square above80,656

Powers & multiples

80,565 to the power 26,490,719,225

80,565 to the power 3522,924,794,362,125

80,565 to the power 442,129,436,057,784,600,625

80,565 to the power 53,394,158,015,995,416,349,353,125

First ten multiples80,565, 161,130, 241,695, 322,260, 402,825, 483,390, 563,955, 644,520, 725,085, 805,650

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

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3Yes

Divisible by 4No, remainder 1

Divisible by 5Yes

Divisible by 6No, remainder 3

Divisible by 7No, remainder 2

Divisible by 8No, remainder 5

Divisible by 9No, remainder 6

Divisible by 10No, remainder 5

Divisible by 11No, remainder 1

Divisible by 12No, remainder 9

Divisible by 100No, remainder 65

Collatz (3n + 1) trajectory

Steps to reach 1138the total stopping time

Highest value reached241,6963× the starting value

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

First steps80,565 → 241,696 → 120,848 → 60,424 → 30,212 → 15,106 → 7,553 → 22,660 → 11,330 → 5,665 → …

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

As a percentage & fraction

As a percentage8,056,500%

80,565% as a decimal805.65

80,565% of 10080,565

80,565% of 1,000805,650

As a fraction of 10080,565/100

Read another way

As seconds22 hours, 22 minutes and 45 seconds

As bytes78.677 KiB

As a 24-bit colour#013AB5

Keep nerding

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