Recognised as Number

28,371

Positive
Odd
Composite
5 digits

28,371 is an odd 5-digit integer and a composite number. It has 12 divisors and a digital root of 3.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value28,371

Digit count5

Digit sum21

Digit product336

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

Digital root3repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberYesdivisible by its own digit sum

Factors & divisors

Prime factorisation3 × 7^2 × 193

Distinct prime factors33, 7, 193

Number of divisors12

Sum of divisors σ(n)44,232

Aliquot sum15,861sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)1,344the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 16,128

Möbius function μ(n)0zero, because a prime divides n twice

SquarefreeNohas a repeated prime factor

All divisors1, 3, 7, 21, 49, 147, 193, 579, 1,351, 4,053, 9,457, 28,37112 in total

Arithmetic

Previous number28,370

Next number28,372

Double56,742

Half14,185.5

Square804,913,641

Cube22,836,204,908,811

Square root168.436931817≈irrational, shown to 9 decimal places

Cube root30.499417708≈

Negation-28,371

Reciprocal0.0000352473≈

Representations

Decimal28,371

Binary11011101101001115 bits

Octal67323

Hexadecimal6ED3

Base 36LW3

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

In wordstwenty-eight thousand, three hundred and seventy-one

Ordinaltwenty-eight thousand, three hundred and seventy-first

Scientific notation2.8371 × 10^4

Engineering notation28.371 × 10^3

In other bases

Ternary1102220210base 3; the most digit-efficient integer base after e: 10 digits

Quinary1401441base 5; one hand: 7 digits

Septenary145500base 7: 6 digits

Nonary42823base 9; each digit is two ternary digits: 5 digits

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

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

Sexagesimal7:52:51base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

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

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

Bit-level

0110111011010011

Bit length15 bitsto write the magnitude

Set bits10the population count, or Hamming weight

Zero bits5within that length

Bit parityeven10 set bits, so even; not the same as the number itself being odd

Highest set bitbit 14worth 16,384

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes26e d3

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

At each machine width

16-bit0110111011010011

32-bit00000000000000000110111011010011

64-bit0000000000000000000000000000000000000000000000000110111011010011

One's complement1001000100101100at 16 bits, every bit flipped

Bits reversed1100101101110110at 16 bits

Rotated left by 11101110110100110at 16 bits, wrapping

Shifted left by 11101110110100110= 56,742, no wrap

Shifted right by 111011101101001= 14,185, discarding the low bit

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

Nearest landmarks

Next prime28,387+16

Previous prime28,351−20

Distance to nearest prime16

Nearest square below28,224

Nearest square above28,561

Powers & multiples

28,371 to the power 2804,913,641

28,371 to the power 322,836,204,908,811

28,371 to the power 4647,885,969,467,876,881

28,371 to the power 518,381,172,839,773,134,990,851

First ten multiples28,371, 56,742, 85,113, 113,484, 141,855, 170,226, 198,597, 226,968, 255,339, 283,710

Powers of twoBetween 2^14 (16,384) and 2^15 (32,768)

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3Yes

Divisible by 4No, remainder 3

Divisible by 5No, remainder 1

Divisible by 6No, remainder 3

Divisible by 7Yes

Divisible by 8No, remainder 3

Divisible by 9No, remainder 3

Divisible by 10No, remainder 1

Divisible by 11No, remainder 2

Divisible by 12No, remainder 3

Divisible by 100No, remainder 71

Collatz (3n + 1) trajectory

Steps to reach 159the total stopping time

Highest value reached127,6724× the starting value

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

First steps28,371 → 85,114 → 42,557 → 127,672 → 63,836 → 31,918 → 15,959 → 47,878 → 23,939 → 71,818 → …

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

As a percentage & fraction

As a percentage2,837,100%

28,371% as a decimal283.71

28,371% of 10028,371

28,371% of 1,000283,710

As a fraction of 10028,371/100

Read another way

As seconds7 hours, 52 minutes and 51 seconds

As bytes27.706 KiB

As a 24-bit colour#006ED3

Keep nerding

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