Recognised as Number

80,357

Positive
Odd
Composite
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value80,357

Digit count5

Digit sum23

Digit product0zero, because one of the digits is zero

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

Digital root5repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation107 × 751

Distinct prime factors2107, 751

Number of divisors4

Sum of divisors σ(n)81,216

Aliquot sum859sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)39,750the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 79,500

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

SquarefreeYesno repeated prime factor

All divisors1, 107, 751, 80,3574 in total

Arithmetic

Previous number80,356

Next number80,358

Double160,714

Half40,178.5

Square6,457,247,449

Cube518,885,033,259,293

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

Cube root43.152693128≈

Negation-80,357

Reciprocal0.0000124445≈

Representations

Decimal80,357

Binary1001110011110010117 bits

Octal234745

Hexadecimal139E5

Base 361Q05

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

In wordseighty thousand, three hundred and fifty-seven

Ordinaleighty thousand, three hundred and fifty-seventh

Scientific notation8.0357 × 10^4

Engineering notation80.357 × 10^3

In other bases

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

Quinary10032412base 5; one hand: 8 digits

Septenary453164base 7: 6 digits

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

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

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

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

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

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

Bit-level

00000000000000010011100111100101

Bit length17 bitsto write the magnitude

Set bits10the population count, or Hamming weight

Zero bits7within that length

Bit parityeven10 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 39 e5

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

At each machine width

32-bit00000000000000010011100111100101

64-bit0000000000000000000000000000000000000000000000010011100111100101

One's complement11111111111111101100011000011010at 32 bits, every bit flipped

Bits reversed10100111100111001000000000000000at 32 bits

Rotated left by 100000000000000100111001111001010at 32 bits, wrapping

Shifted left by 1100111001111001010= 160,714, no wrap

Shifted right by 11001110011110010= 40,178, discarding the low bit

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

Nearest landmarks

Next prime80,363+6

Previous prime80,347−10

Distance to nearest prime6

Nearest square below80,089

Nearest square above80,656

Powers & multiples

80,357 to the power 26,457,247,449

80,357 to the power 3518,885,033,259,293

80,357 to the power 441,696,044,617,617,007,601

80,357 to the power 53,350,569,057,337,849,879,793,557

First ten multiples80,357, 160,714, 241,071, 321,428, 401,785, 482,142, 562,499, 642,856, 723,213, 803,570

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 5No, remainder 2

Divisible by 6No, remainder 5

Divisible by 7No, remainder 4

Divisible by 8No, remainder 5

Divisible by 9No, remainder 5

Divisible by 10No, remainder 7

Divisible by 11No, remainder 2

Divisible by 12No, remainder 5

Divisible by 100No, remainder 57

Collatz (3n + 1) trajectory

Steps to reach 1120the total stopping time

Highest value reached241,0723× the starting value

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

First steps80,357 → 241,072 → 120,536 → 60,268 → 30,134 → 15,067 → 45,202 → 22,601 → 67,804 → 33,902 → …

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

As a percentage & fraction

As a percentage8,035,700%

80,357% as a decimal803.57

80,357% of 10080,357

80,357% of 1,000803,570

As a fraction of 10080,357/100

Read another way

As seconds22 hours, 19 minutes and 17 seconds

As bytes78.474 KiB

As a 24-bit colour#0139E5

Keep nerding

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