Number

27,391

Positive
Odd
Composite
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value27,391

Digit count5

Digit sum22

Digital root4repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation7^2 × 13 × 43

Distinct prime factors37, 13, 43

Number of divisors12

Sum of divisors σ(n)35,112

Aliquot sum7,721sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

SquarefreeNohas a repeated prime factor

All divisors1, 7, 13, 43, 49, 91, 301, 559, 637, 2,107, 3,913, 27,39112 in total

Arithmetic

Previous number27,390

Next number27,392

Double54,782

Half13,695.5

Square750,266,881

Cube20,550,560,137,471

Square root165.502265846≈irrational, shown to 9 decimal places

Cube root30.144121341≈

Negation-27,391

Reciprocal0.0000365083≈

Representations

Decimal27,391

Binary11010101111111115 bits

Octal65377

Hexadecimal6AFF

Base 36L4V

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

In wordstwenty-seven thousand, three hundred and ninety-one

Ordinaltwenty-seven thousand, three hundred and ninety-first

Scientific notation2.7391 × 10^4

Engineering notation27.391 × 10^3

Nearest landmarks

Next prime27,397+6

Previous prime27,367−24

Distance to nearest prime6

Nearest square below27,225

Nearest square above27,556

Powers & multiples

27,391 to the power 2750,266,881

27,391 to the power 320,550,560,137,471

27,391 to the power 4562,900,392,725,468,161

27,391 to the power 515,418,404,657,143,298,397,951

First ten multiples27,391, 54,782, 82,173, 109,564, 136,955, 164,346, 191,737, 219,128, 246,519, 273,910

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 1

Divisible by 6No, remainder 1

Divisible by 7Yes

Divisible by 8No, remainder 7

Divisible by 9No, remainder 4

Divisible by 10No, remainder 1

Divisible by 11No, remainder 1

Divisible by 12No, remainder 7

Divisible by 100No, remainder 91

Collatz (3n + 1) trajectory

Steps to reach 1183the total stopping time

Highest value reached1,404,05251× the starting value

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

First steps27,391 → 82,174 → 41,087 → 123,262 → 61,631 → 184,894 → 92,447 → 277,342 → 138,671 → 416,014 → …

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

As a percentage & fraction

As a percentage2,739,100%

27,391% as a decimal273.91

27,391% of 10027,391

27,391% of 1,000273,910

As a fraction of 10027,391/100

Read another way

As seconds7 hours, 36 minutes and 31 seconds

As bytes26.749 KiB

As a 24-bit colour#006AFF

Keep nerding

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