Recognised as Number

17,157

Positive
Odd
Composite
5 digits

17,157 is an odd 5-digit integer and a composite number. It has 16 divisors and a digital root of 3.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value17,157

Digit count5

Digit sum21

Digit product245

Multiplicative persistence3times 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 × 19 × 43

Distinct prime factors43, 7, 19, 43

Number of divisors16

Sum of divisors σ(n)28,160

Aliquot sum11,003sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)126the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 9,072

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

SquarefreeYesno repeated prime factor

All divisors1, 3, 7, 19, 21, 43, 57, 129, 133, 301, 399, 817, 903, 2,451, 5,719, 17,15716 in total

Arithmetic

Previous number17,156

Next number17,158

Double34,314

Half8,578.5

Square294,362,649

Cube5,050,379,968,893

Square root130.984731935≈irrational, shown to 9 decimal places

Cube root25.791728615≈

Negation-17,157

Reciprocal0.0000582852≈

Representations

Decimal17,157

Binary10000110000010115 bits

Octal41405

Hexadecimal4305

Base 36D8L

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

In wordsseventeen thousand, one hundred and fifty-seven

Ordinalseventeen thousand, one hundred and fifty-seventh

Scientific notation1.7157 × 10^4

Engineering notation17.157 × 10^3

In other bases

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

Quinary1022112base 5; one hand: 7 digits

Septenary101010base 7: 6 digits

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

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

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

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

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

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

Bit-level

0100001100000101

Bit length15 bitsto write the magnitude

Set bits5the population count, or Hamming weight

Zero bits10within that length

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

Highest set bitbit 14worth 16,384

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes243 05

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

At each machine width

16-bit0100001100000101

32-bit00000000000000000100001100000101

64-bit0000000000000000000000000000000000000000000000000100001100000101

One's complement1011110011111010at 16 bits, every bit flipped

Bits reversed1010000011000010at 16 bits

Rotated left by 11000011000001010at 16 bits, wrapping

Shifted left by 11000011000001010= 34,314, no wrap

Shifted right by 110000110000010= 8,578, discarding the low bit

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

Nearest landmarks

Next prime17,159+2

Previous prime17,137−20

Distance to nearest prime2

Nearest square below16,900

Nearest square above17,161

Powers & multiples

17,157 to the power 2294,362,649

17,157 to the power 35,050,379,968,893

17,157 to the power 486,649,369,126,297,201

17,157 to the power 51,486,643,226,099,881,077,557

First ten multiples17,157, 34,314, 51,471, 68,628, 85,785, 102,942, 120,099, 137,256, 154,413, 171,570

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 1

Divisible by 5No, remainder 2

Divisible by 6No, remainder 3

Divisible by 7Yes

Divisible by 8No, remainder 5

Divisible by 9No, remainder 3

Divisible by 10No, remainder 7

Divisible by 11No, remainder 8

Divisible by 12No, remainder 9

Divisible by 100No, remainder 57

Collatz (3n + 1) trajectory

Steps to reach 179the total stopping time

Highest value reached51,4723× the starting value

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

First steps17,157 → 51,472 → 25,736 → 12,868 → 6,434 → 3,217 → 9,652 → 4,826 → 2,413 → 7,240 → …

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

As a percentage & fraction

As a percentage1,715,700%

17,157% as a decimal171.57

17,157% of 10017,157

17,157% of 1,000171,570

As a fraction of 10017,157/100

Read another way

As seconds4 hours, 45 minutes and 57 seconds

As bytes16.755 KiB

As a 24-bit colour#004305

Keep nerding

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