Recognised as Number

16,159

Positive
Odd
Composite
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value16,159

Digit count5

Digit sum22

Digit product270

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

Digital root4repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation11 × 13 × 113

Distinct prime factors311, 13, 113

Number of divisors8

Sum of divisors σ(n)19,152

Aliquot sum2,993sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)1,680the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 13,440

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

SquarefreeYesno repeated prime factor

All divisors1, 11, 13, 113, 143, 1,243, 1,469, 16,1598 in total

Arithmetic

Previous number16,158

Next number16,160

Double32,318

Half8,079.5

Square261,113,281

Cube4,219,329,507,679

Square root127.118055366≈irrational, shown to 9 decimal places

Cube root25.28161579≈

Negation-16,159

Reciprocal0.000061885≈

Representations

Decimal16,159

Binary1111110001111114 bits

Octal37437

Hexadecimal3F1F

Base 36CGV

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

In wordssixteen thousand, one hundred and fifty-nine

Ordinalsixteen thousand, one hundred and fifty-ninth

Scientific notation1.6159 × 10^4

Engineering notation16.159 × 10^3

In other bases

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

Quinary1004114base 5; one hand: 7 digits

Septenary65053base 7: 5 digits

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

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

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

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

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

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

Bit-level

0011111100011111

Bit length14 bitsto write the magnitude

Set bits11the population count, or Hamming weight

Zero bits3within that length

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

Highest set bitbit 13worth 8,192

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes23f 1f

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

At each machine width

16-bit0011111100011111

32-bit00000000000000000011111100011111

64-bit0000000000000000000000000000000000000000000000000011111100011111

One's complement1100000011100000at 16 bits, every bit flipped

Bits reversed1111100011111100at 16 bits

Rotated left by 10111111000111110at 16 bits, wrapping

Shifted left by 1111111000111110= 32,318, no wrap

Shifted right by 11111110001111= 8,079, discarding the low bit

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

Nearest landmarks

Next prime16,183+24

Previous prime16,141−18

Distance to nearest prime18

Nearest square below16,129

Nearest square above16,384

Powers & multiples

16,159 to the power 2261,113,281

16,159 to the power 34,219,329,507,679

16,159 to the power 468,180,145,514,584,961

16,159 to the power 51,101,722,971,370,178,384,799

First ten multiples16,159, 32,318, 48,477, 64,636, 80,795, 96,954, 113,113, 129,272, 145,431, 161,590

Powers of twoBetween 2^13 (8,192) and 2^14 (16,384)

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 1

Divisible by 4No, remainder 3

Divisible by 5No, remainder 4

Divisible by 6No, remainder 1

Divisible by 7No, remainder 3

Divisible by 8No, remainder 7

Divisible by 9No, remainder 4

Divisible by 10No, remainder 9

Divisible by 11Yes

Divisible by 12No, remainder 7

Divisible by 100No, remainder 59

Collatz (3n + 1) trajectory

Steps to reach 1190the total stopping time

Highest value reached6,810,136421× the starting value

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

First steps16,159 → 48,478 → 24,239 → 72,718 → 36,359 → 109,078 → 54,539 → 163,618 → 81,809 → 245,428 → …

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

As a percentage & fraction

As a percentage1,615,900%

16,159% as a decimal161.59

16,159% of 10016,159

16,159% of 1,000161,590

As a fraction of 10016,159/100

Read another way

As seconds4 hours, 29 minutes and 19 seconds

As bytes15.78 KiB

As a 24-bit colour#003F1F

Keep nerding

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