Recognised as Number

80,403

Positive
Odd
Composite
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value80,403

Digit count5

Digit sum15

Digit product0zero, because one of the digits is zero

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

Digital root6repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3 × 26,801

Distinct prime factors23, 26,801

Number of divisors4

Sum of divisors σ(n)107,208

Aliquot sum26,805sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)26,800the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 53,600

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

SquarefreeYesno repeated prime factor

All divisors1, 3, 26,801, 80,4034 in total

Arithmetic

Previous number80,402

Next number80,404

Double160,806

Half40,201.5

Square6,464,642,409

Cube519,776,643,610,827

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

Cube root43.160925745≈

Negation-80,403

Reciprocal0.0000124373≈

Representations

Decimal80,403

Binary1001110100001001117 bits

Octal235023

Hexadecimal13A13

Base 361Q1F

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

In wordseighty thousand, four hundred and three

Ordinaleighty thousand, four hundred and third

Scientific notation8.0403 × 10^4

Engineering notation80.403 × 10^3

In other bases

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

Quinary10033103base 5; one hand: 8 digits

Septenary453261base 7: 6 digits

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

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

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

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

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

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

Bit-level

00000000000000010011101000010011

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 13

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

At each machine width

32-bit00000000000000010011101000010011

64-bit0000000000000000000000000000000000000000000000010011101000010011

One's complement11111111111111101100010111101100at 32 bits, every bit flipped

Bits reversed11001000010111001000000000000000at 32 bits

Rotated left by 100000000000000100111010000100110at 32 bits, wrapping

Shifted left by 1100111010000100110= 160,806, no wrap

Shifted right by 11001110100001001= 40,201, discarding the low bit

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

Nearest landmarks

Next prime80,407+4

Previous prime80,387−16

Distance to nearest prime4

Nearest square below80,089

Nearest square above80,656

Powers & multiples

80,403 to the power 26,464,642,409

80,403 to the power 3519,776,643,610,827

80,403 to the power 441,791,601,476,241,323,281

80,403 to the power 53,360,170,133,494,231,115,762,243

First ten multiples80,403, 160,806, 241,209, 321,612, 402,015, 482,418, 562,821, 643,224, 723,627, 804,030

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 3

Divisible by 5No, remainder 3

Divisible by 6No, remainder 3

Divisible by 7No, remainder 1

Divisible by 8No, remainder 3

Divisible by 9No, remainder 6

Divisible by 10No, remainder 3

Divisible by 11No, remainder 4

Divisible by 12No, remainder 3

Divisible by 100No, remainder 3

Collatz (3n + 1) trajectory

Steps to reach 194the total stopping time

Highest value reached361,8164× the starting value

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

First steps80,403 → 241,210 → 120,605 → 361,816 → 180,908 → 90,454 → 45,227 → 135,682 → 67,841 → 203,524 → …

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

As a percentage & fraction

As a percentage8,040,300%

80,403% as a decimal804.03

80,403% of 10080,403

80,403% of 1,000804,030

As a fraction of 10080,403/100

Read another way

As seconds22 hours, 20 minutes and 3 seconds

As bytes78.519 KiB

As a 24-bit colour#013A13

Keep nerding

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