Recognised as Number

28,370

Positive
Even
Composite
5 digits

28,370 is an even 5-digit integer and a composite number. It has 8 divisors and a digital root of 2.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value28,370

Digit count5

Digit sum20

Digit product0zero, because one of the digits is zero

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

Digital root2repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 5 × 2,837

Distinct prime factors32, 5, 2,837

Number of divisors8

Sum of divisors σ(n)51,084

Aliquot sum22,714sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

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

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

SquarefreeYesno repeated prime factor

All divisors1, 2, 5, 10, 2,837, 5,674, 14,185, 28,3708 in total

Arithmetic

Previous number28,369

Next number28,371

Double56,740

Half14,185

Square804,856,900

Cube22,833,790,253,000

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

Cube root30.499059364≈

Negation-28,370

Reciprocal0.0000352485≈

Representations

Decimal28,370

Binary11011101101001015 bits

Octal67322

Hexadecimal6ED2

Base 36LW2

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

In wordstwenty-eight thousand, three hundred and seventy

Ordinaltwenty-eight thousand, three hundred and seventieth

Scientific notation2.837 × 10^4

Engineering notation28.37 × 10^3

In other bases

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

Quinary1401440base 5; one hand: 7 digits

Septenary145466base 7: 6 digits

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

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

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

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

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

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

Bit-level

0110111011010010

Bit length15 bitsto write the magnitude

Set bits9the population count, or Hamming weight

Zero bits6within that length

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

Highest set bitbit 14worth 16,384

Lowest set bitbit 11 trailing zero

Power of twoNo

Bytes26e d2

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

At each machine width

16-bit0110111011010010

32-bit00000000000000000110111011010010

64-bit0000000000000000000000000000000000000000000000000110111011010010

One's complement1001000100101101at 16 bits, every bit flipped

Bits reversed0100101101110110at 16 bits

Rotated left by 11101110110100100at 16 bits, wrapping

Shifted left by 11101110110100100= 56,740, no wrap

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

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

Nearest landmarks

Next prime28,387+17

Previous prime28,351−19

Distance to nearest prime17

Nearest square below28,224

Nearest square above28,561

Powers & multiples

28,370 to the power 2804,856,900

28,370 to the power 322,833,790,253,000

28,370 to the power 4647,794,629,477,610,000

28,370 to the power 518,377,933,638,279,795,700,000

First ten multiples28,370, 56,740, 85,110, 113,480, 141,850, 170,220, 198,590, 226,960, 255,330, 283,700

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

Divisibility tests

Divisible by 2Yes

Divisible by 3No, remainder 2

Divisible by 4No, remainder 2

Divisible by 5Yes

Divisible by 6No, remainder 2

Divisible by 7No, remainder 6

Divisible by 8No, remainder 2

Divisible by 9No, remainder 2

Divisible by 10Yes

Divisible by 11No, remainder 1

Divisible by 12No, remainder 2

Divisible by 100No, remainder 70

Collatz (3n + 1) trajectory

Steps to reach 159the total stopping time

Highest value reached107,7283× the starting value

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

First steps28,370 → 14,185 → 42,556 → 21,278 → 10,639 → 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,000%

28,370% as a decimal283.7

28,370% of 10028,370

28,370% of 1,000283,700

As a fraction of 10028,370/100

Read another way

As seconds7 hours, 52 minutes and 50 seconds

As bytes27.705 KiB

As a 24-bit colour#006ED2

Keep nerding

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