Recognised as Number

17,228

Positive
Even
Composite
5 digits

17,228 is an even 5-digit integer and a composite number. It has 12 divisors and a digital root of 2.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value17,228

Digit count5

Digit sum20

Digit product224

Multiplicative persistence3times 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^2 × 59 × 73

Distinct prime factors32, 59, 73

Number of divisors12

Sum of divisors σ(n)31,080

Aliquot sum13,852sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

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

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

SquarefreeNohas a repeated prime factor

All divisors1, 2, 4, 59, 73, 118, 146, 236, 292, 4,307, 8,614, 17,22812 in total

Arithmetic

Previous number17,227

Next number17,229

Double34,456

Half8,614

Square296,803,984

Cube5,113,339,036,352

Square root131.255476076≈irrational, shown to 9 decimal places

Cube root25.827257214≈

Negation-17,228

Reciprocal0.000058045≈

Representations

Decimal17,228

Binary10000110100110015 bits

Octal41514

Hexadecimal434C

Base 36DAK

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

In wordsseventeen thousand, two hundred and twenty-eight

Ordinalseventeen thousand, two hundred and twenty-eighth

Scientific notation1.7228 × 10^4

Engineering notation17.228 × 10^3

In other bases

Ternary212122002base 3; the most digit-efficient integer base after e: 9 digits

Quinary1022403base 5; one hand: 7 digits

Septenary101141base 7: 6 digits

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

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

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

Sexagesimal4:47:8base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

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

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

Bit-level

0100001101001100

Bit length15 bitsto write the magnitude

Set bits6the population count, or Hamming weight

Zero bits9within that length

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

Highest set bitbit 14worth 16,384

Lowest set bitbit 22 trailing zeros

Power of twoNo

Bytes243 4c

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

At each machine width

16-bit0100001101001100

32-bit00000000000000000100001101001100

64-bit0000000000000000000000000000000000000000000000000100001101001100

One's complement1011110010110011at 16 bits, every bit flipped

Bits reversed0011001011000010at 16 bits

Rotated left by 11000011010011000at 16 bits, wrapping

Shifted left by 11000011010011000= 34,456, no wrap

Shifted right by 110000110100110= 8,614, discarding the low bit

These bits as a double8.51176295 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime17,231+3

Previous prime17,209−19

Distance to nearest prime3

Nearest square below17,161

Nearest square above17,424

Powers & multiples

17,228 to the power 2296,803,984

17,228 to the power 35,113,339,036,352

17,228 to the power 488,092,604,918,272,256

17,228 to the power 51,517,659,397,531,994,426,368

First ten multiples17,228, 34,456, 51,684, 68,912, 86,140, 103,368, 120,596, 137,824, 155,052, 172,280

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

Divisibility tests

Divisible by 2Yes

Divisible by 3No, remainder 2

Divisible by 4Yes

Divisible by 5No, remainder 3

Divisible by 6No, remainder 2

Divisible by 7No, remainder 1

Divisible by 8No, remainder 4

Divisible by 9No, remainder 2

Divisible by 10No, remainder 8

Divisible by 11No, remainder 2

Divisible by 12No, remainder 8

Divisible by 100No, remainder 28

Collatz (3n + 1) trajectory

Steps to reach 179the total stopping time

Highest value reached39,3642× the starting value

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

First steps17,228 → 8,614 → 4,307 → 12,922 → 6,461 → 19,384 → 9,692 → 4,846 → 2,423 → 7,270 → …

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

As a percentage & fraction

As a percentage1,722,800%

17,228% as a decimal172.28

17,228% of 10017,228

17,228% of 1,000172,280

As a fraction of 10017,228/100

Read another way

As seconds4 hours, 47 minutes and 8 seconds

As bytes16.824 KiB

As a 24-bit colour#00434C

Keep nerding

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