Recognised as Number

16,161

Positive
Odd
Composite
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value16,161

Digit count5

Digit sum15

Digit product36

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

Digital root6repeated digit sum

PalindromicYesreads the same backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3 × 5,387

Distinct prime factors23, 5,387

Number of divisors4

Sum of divisors σ(n)21,552

Aliquot sum5,391sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)5,386the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 10,772

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

SquarefreeYesno repeated prime factor

All divisors1, 3, 5,387, 16,1614 in total

Arithmetic

Previous number16,160

Next number16,162

Double32,322

Half8,080.5

Square261,177,921

Cube4,220,896,381,281

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

Cube root25.282658783≈

Negation-16,161

Reciprocal0.0000618774≈

Representations

Decimal16,161

Binary1111110010000114 bits

Octal37441

Hexadecimal3F21

Base 36CGX

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

In wordssixteen thousand, one hundred and sixty-one

Ordinalsixteen thousand, one hundred and sixty-first

Scientific notation1.6161 × 10^4

Engineering notation16.161 × 10^3

In other bases

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

Quinary1004121base 5; one hand: 7 digits

Septenary65055base 7: 5 digits

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

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

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

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

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

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

Bit-level

0011111100100001

Bit length14 bitsto write the magnitude

Set bits8the population count, or Hamming weight

Zero bits6within that length

Bit parityeven8 set bits, so even; 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 21

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

At each machine width

16-bit0011111100100001

32-bit00000000000000000011111100100001

64-bit0000000000000000000000000000000000000000000000000011111100100001

One's complement1100000011011110at 16 bits, every bit flipped

Bits reversed1000010011111100at 16 bits

Rotated left by 10111111001000010at 16 bits, wrapping

Shifted left by 1111111001000010= 32,322, no wrap

Shifted right by 11111110010000= 8,080, discarding the low bit

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

Nearest landmarks

Next prime16,183+22

Previous prime16,141−20

Distance to nearest prime20

Nearest square below16,129

Nearest square above16,384

Powers & multiples

16,161 to the power 2261,177,921

16,161 to the power 34,220,896,381,281

16,161 to the power 468,213,906,417,882,241

16,161 to the power 51,102,404,941,619,394,896,801

First ten multiples16,161, 32,322, 48,483, 64,644, 80,805, 96,966, 113,127, 129,288, 145,449, 161,610

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

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3Yes

Divisible by 4No, remainder 1

Divisible by 5No, remainder 1

Divisible by 6No, remainder 3

Divisible by 7No, remainder 5

Divisible by 8No, remainder 1

Divisible by 9No, remainder 6

Divisible by 10No, remainder 1

Divisible by 11No, remainder 2

Divisible by 12No, remainder 9

Divisible by 100No, remainder 61

Collatz (3n + 1) trajectory

Steps to reach 1146the total stopping time

Highest value reached48,4843× the starting value

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

First steps16,161 → 48,484 → 24,242 → 12,121 → 36,364 → 18,182 → 9,091 → 27,274 → 13,637 → 40,912 → …

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

As a percentage & fraction

As a percentage1,616,100%

16,161% as a decimal161.61

16,161% of 10016,161

16,161% of 1,000161,610

As a fraction of 10016,161/100

Read another way

As seconds4 hours, 29 minutes and 21 seconds

As bytes15.782 KiB

As a 24-bit colour#003F21

Keep nerding

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