Recognised as Number

80,405

Positive
Odd
Composite
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value80,405

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 factorisation5 × 13 × 1,237

Distinct prime factors35, 13, 1,237

Number of divisors8

Sum of divisors σ(n)103,992

Aliquot sum23,587sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)1,236the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 59,328

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

SquarefreeYesno repeated prime factor

All divisors1, 5, 13, 65, 1,237, 6,185, 16,081, 80,4058 in total

Arithmetic

Previous number80,404

Next number80,406

Double160,810

Half40,202.5

Square6,464,964,025

Cube519,815,432,430,125

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

Cube root43.161283614≈

Negation-80,405

Reciprocal0.000012437≈

Representations

Decimal80,405

Binary1001110100001010117 bits

Octal235025

Hexadecimal13A15

Base 361Q1H

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

In wordseighty thousand, four hundred and five

Ordinaleighty thousand, four hundred and fifth

Scientific notation8.0405 × 10^4

Engineering notation80.405 × 10^3

In other bases

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

Quinary10033110base 5; one hand: 8 digits

Septenary453263base 7: 6 digits

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

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

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

Sexagesimal22:20:5base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

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

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

Bit-level

00000000000000010011101000010101

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 3a 15

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

At each machine width

32-bit00000000000000010011101000010101

64-bit0000000000000000000000000000000000000000000000010011101000010101

One's complement11111111111111101100010111101010at 32 bits, every bit flipped

Bits reversed10101000010111001000000000000000at 32 bits

Rotated left by 100000000000000100111010000101010at 32 bits, wrapping

Shifted left by 1100111010000101010= 160,810, no wrap

Shifted right by 11001110100001010= 40,202, discarding the low bit

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

Nearest landmarks

Next prime80,407+2

Previous prime80,387−18

Distance to nearest prime2

Nearest square below80,089

Nearest square above80,656

Powers & multiples

80,405 to the power 26,464,964,025

80,405 to the power 3519,815,432,430,125

80,405 to the power 441,795,759,844,544,200,625

80,405 to the power 53,360,588,070,300,576,451,253,125

First ten multiples80,405, 160,810, 241,215, 321,620, 402,025, 482,430, 562,835, 643,240, 723,645, 804,050

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 5Yes

Divisible by 6No, remainder 5

Divisible by 7No, remainder 3

Divisible by 8No, remainder 5

Divisible by 9No, remainder 8

Divisible by 10No, remainder 5

Divisible by 11No, remainder 6

Divisible by 12No, remainder 5

Divisible by 100No, remainder 5

Collatz (3n + 1) trajectory

Steps to reach 1120the total stopping time

Highest value reached241,2163× the starting value

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

First steps80,405 → 241,216 → 120,608 → 60,304 → 30,152 → 15,076 → 7,538 → 3,769 → 11,308 → 5,654 → …

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

As a percentage & fraction

As a percentage8,040,500%

80,405% as a decimal804.05

80,405% of 10080,405

80,405% of 1,000804,050

As a fraction of 10080,405/100

Read another way

As seconds22 hours, 20 minutes and 5 seconds

As bytes78.521 KiB

As a 24-bit colour#013A15

Keep nerding

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