Recognised as Number

27,139

Positive
Odd
Composite
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value27,139

Digit count5

Digit sum22

Digit product378

Multiplicative persistence5times 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 factorisation7 × 3,877

Distinct prime factors27, 3,877

Number of divisors4

Sum of divisors σ(n)31,024

Aliquot sum3,885sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)3,876the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 23,256

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

SquarefreeYesno repeated prime factor

All divisors1, 7, 3,877, 27,1394 in total

Arithmetic

Previous number27,138

Next number27,140

Double54,278

Half13,569.5

Square736,525,321

Cube19,988,560,686,619

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

Cube root30.051393389≈

Negation-27,139

Reciprocal0.0000368473≈

Representations

Decimal27,139

Binary11010100000001115 bits

Octal65003

Hexadecimal6A03

Base 36KXV

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

In wordstwenty-seven thousand, one hundred and thirty-nine

Ordinaltwenty-seven thousand, one hundred and thirty-ninth

Scientific notation2.7139 × 10^4

Engineering notation27.139 × 10^3

In other bases

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

Quinary1332024base 5; one hand: 7 digits

Septenary142060base 7: 6 digits

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

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

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

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

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

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

Bit-level

0110101000000011

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 03

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

At each machine width

16-bit0110101000000011

32-bit00000000000000000110101000000011

64-bit0000000000000000000000000000000000000000000000000110101000000011

One's complement1001010111111100at 16 bits, every bit flipped

Bits reversed1100000001010110at 16 bits

Rotated left by 11101010000000110at 16 bits, wrapping

Shifted left by 11101010000000110= 54,278, no wrap

Shifted right by 111010100000001= 13,569, discarding the low bit

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

Nearest landmarks

Next prime27,143+4

Previous prime27,127−12

Distance to nearest prime4

Nearest square below26,896

Nearest square above27,225

Powers & multiples

27,139 to the power 2736,525,321

27,139 to the power 319,988,560,686,619

27,139 to the power 4542,469,548,474,153,041

27,139 to the power 514,722,081,076,040,039,379,699

First ten multiples27,139, 54,278, 81,417, 108,556, 135,695, 162,834, 189,973, 217,112, 244,251, 271,390

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

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 7Yes

Divisible by 8No, remainder 3

Divisible by 9No, remainder 4

Divisible by 10No, remainder 9

Divisible by 11No, remainder 2

Divisible by 12No, remainder 7

Divisible by 100No, remainder 39

Collatz (3n + 1) trajectory

Steps to reach 138the total stopping time

Highest value reached122,1284× the starting value

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

First steps27,139 → 81,418 → 40,709 → 122,128 → 61,064 → 30,532 → 15,266 → 7,633 → 22,900 → 11,450 → …

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

As a percentage & fraction

As a percentage2,713,900%

27,139% as a decimal271.39

27,139% of 10027,139

27,139% of 1,000271,390

As a fraction of 10027,139/100

Read another way

As seconds7 hours, 32 minutes and 19 seconds

As bytes26.503 KiB

As a 24-bit colour#006A03

Keep nerding

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