Recognised as Number

27,141

Positive
Odd
Composite
5 digits

27,141 is an odd 5-digit integer and a composite number. It has 8 divisors and a digital root of 6.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value27,141

Digit count5

Digit sum15

Digit product56

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

Digital root6repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3 × 83 × 109

Distinct prime factors33, 83, 109

Number of divisors8

Sum of divisors σ(n)36,960

Aliquot sum9,819sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)4,428the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 17,712

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

SquarefreeYesno repeated prime factor

All divisors1, 3, 83, 109, 249, 327, 9,047, 27,1418 in total

Arithmetic

Previous number27,140

Next number27,142

Double54,282

Half13,570.5

Square736,633,881

Cube19,992,980,164,221

Square root164.745257898≈irrational, shown to 9 decimal places

Cube root30.05213158≈

Negation-27,141

Reciprocal0.0000368446≈

Representations

Decimal27,141

Binary11010100000010115 bits

Octal65005

Hexadecimal6A05

Base 36KXX

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

In wordstwenty-seven thousand, one hundred and forty-one

Ordinaltwenty-seven thousand, one hundred and forty-first

Scientific notation2.7141 × 10^4

Engineering notation27.141 × 10^3

In other bases

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

Quinary1332031base 5; one hand: 7 digits

Septenary142062base 7: 6 digits

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

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

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

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

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

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

Bit-level

0110101000000101

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 odd

Highest set bitbit 14worth 16,384

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes26a 05

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

At each machine width

16-bit0110101000000101

32-bit00000000000000000110101000000101

64-bit0000000000000000000000000000000000000000000000000110101000000101

One's complement1001010111111010at 16 bits, every bit flipped

Bits reversed1010000001010110at 16 bits

Rotated left by 11101010000001010at 16 bits, wrapping

Shifted left by 11101010000001010= 54,282, no wrap

Shifted right by 111010100000010= 13,570, discarding the low bit

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

Nearest landmarks

Next prime27,143+2

Previous prime27,127−14

Distance to nearest prime2

Nearest square below26,896

Nearest square above27,225

Powers & multiples

27,141 to the power 2736,633,881

27,141 to the power 319,992,980,164,221

27,141 to the power 4542,629,474,637,122,161

27,141 to the power 514,727,506,571,126,132,571,701

First ten multiples27,141, 54,282, 81,423, 108,564, 135,705, 162,846, 189,987, 217,128, 244,269, 271,410

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 1

Divisible by 6No, remainder 3

Divisible by 7No, remainder 2

Divisible by 8No, remainder 5

Divisible by 9No, remainder 6

Divisible by 10No, remainder 1

Divisible by 11No, remainder 4

Divisible by 12No, remainder 9

Divisible by 100No, remainder 41

Collatz (3n + 1) trajectory

Steps to reach 190the total stopping time

Highest value reached81,4243× the starting value

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

First steps27,141 → 81,424 → 40,712 → 20,356 → 10,178 → 5,089 → 15,268 → 7,634 → 3,817 → 11,452 → …

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

As a percentage & fraction

As a percentage2,714,100%

27,141% as a decimal271.41

27,141% of 10027,141

27,141% of 1,000271,410

As a fraction of 10027,141/100

Read another way

As seconds7 hours, 32 minutes and 21 seconds

As bytes26.505 KiB

As a 24-bit colour#006A05

Keep nerding

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