Recognised as Number

80,353

Positive
Odd
Composite
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value80,353

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 factorisation7 × 13 × 883

Distinct prime factors37, 13, 883

Number of divisors8

Sum of divisors σ(n)99,008

Aliquot sum18,655sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)1,764the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 63,504

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

SquarefreeYesno repeated prime factor

All divisors1, 7, 13, 91, 883, 6,181, 11,479, 80,3538 in total

Arithmetic

Previous number80,352

Next number80,354

Double160,706

Half40,176.5

Square6,456,604,609

Cube518,807,550,146,977

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

Cube root43.1519771≈

Negation-80,353

Reciprocal0.0000124451≈

Representations

Decimal80,353

Binary1001110011110000117 bits

Octal234741

Hexadecimal139E1

Base 361Q01

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

In wordseighty thousand, three hundred and fifty-three

Ordinaleighty thousand, three hundred and fifty-third

Scientific notation8.0353 × 10^4

Engineering notation80.353 × 10^3

In other bases

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

Quinary10032403base 5; one hand: 8 digits

Septenary453160base 7: 6 digits

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

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

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

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

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

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

Bit-level

00000000000000010011100111100001

Bit length17 bitsto write the magnitude

Set bits9the population count, or Hamming weight

Zero bits8within that length

Bit parityodd9 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 39 e1

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

At each machine width

32-bit00000000000000010011100111100001

64-bit0000000000000000000000000000000000000000000000010011100111100001

One's complement11111111111111101100011000011110at 32 bits, every bit flipped

Bits reversed10000111100111001000000000000000at 32 bits

Rotated left by 100000000000000100111001111000010at 32 bits, wrapping

Shifted left by 1100111001111000010= 160,706, no wrap

Shifted right by 11001110011110000= 40,176, discarding the low bit

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

Nearest landmarks

Next prime80,363+10

Previous prime80,347−6

Distance to nearest prime6

Nearest square below80,089

Nearest square above80,656

Powers & multiples

80,353 to the power 26,456,604,609

80,353 to the power 3518,807,550,146,977

80,353 to the power 441,687,743,076,960,042,881

80,353 to the power 53,349,735,219,462,970,325,616,993

First ten multiples80,353, 160,706, 241,059, 321,412, 401,765, 482,118, 562,471, 642,824, 723,177, 803,530

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

Divisible by 8No, remainder 1

Divisible by 9No, remainder 1

Divisible by 10No, remainder 3

Divisible by 11No, remainder 9

Divisible by 12No, remainder 1

Divisible by 100No, remainder 53

Collatz (3n + 1) trajectory

Steps to reach 168the total stopping time

Highest value reached457,6485× the starting value

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

First steps80,353 → 241,060 → 120,530 → 60,265 → 180,796 → 90,398 → 45,199 → 135,598 → 67,799 → 203,398 → …

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

As a percentage & fraction

As a percentage8,035,300%

80,353% as a decimal803.53

80,353% of 10080,353

80,353% of 1,000803,530

As a fraction of 10080,353/100

Read another way

As seconds22 hours, 19 minutes and 13 seconds

As bytes78.47 KiB

As a 24-bit colour#0139E1

Keep nerding

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