Nerdulator> put something in

Number

27,691

  • Positive
  • Odd
  • Prime
  • 5 digits

27,691 is an odd 5-digit integer and a prime number. It has 2 divisors and a digital root of 7.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value27,691
Digit count5
Digit sum25
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation27,691
Distinct prime factors127,691
Number of divisors2
Sum of divisors σ(n)27,692
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)27,690integers below n that share no factor with it
SquarefreeYesno repeated prime factor
All divisors1, 27,6912 in total

Arithmetic

Previous number27,690
Next number27,692
Double55,382
Square root166.406129695irrational, shown to 9 decimal places
Cube root30.253773179
Negation-27,691
Reciprocal0.0000361128

Representations

Decimal27,691
Binary11011000010101115 bits
Octal66053
Hexadecimal6C2B
Base 36LD7
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwenty-seven thousand, six hundred and ninety-one
Ordinaltwenty-seven thousand, six hundred and ninety-first
Scientific notation2.7691 × 10^4
Engineering notation27.691 × 10^3

Nearest landmarks

Next prime27,697+6
Previous prime27,689−2
Distance to nearest prime0, it is prime
Nearest square below27,556
Nearest square above27,889

Powers & multiples

27,691 to the power 2766,791,481
27,691 to the power 321,233,222,900,371
27,691 to the power 4587,969,175,334,173,361
27,691 to the power 516,281,454,434,178,594,539,451
First ten multiples27,691, 55,382, 83,073, 110,764, 138,455, 166,146, 193,837, 221,528, 249,219, 276,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 7No, remainder 6
Divisible by 8No, remainder 3
Divisible by 9No, remainder 7
Divisible by 10No, remainder 1
Divisible by 11No, remainder 4
Divisible by 12No, remainder 7
Divisible by 100No, remainder 91

Collatz (3n + 1) trajectory

Steps to reach 190the total stopping time
Highest value reached124,6124× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps27,691 → 83,074 → 41,537 → 124,612 → 62,306 → 31,153 → 93,460 → 46,730 → 23,365 → 70,096 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage2,769,100%
27,691% as a decimal276.91
27,691% of 10027,691
27,691% of 1,000276,910
As a fraction of 10027,691/100

Read another way

As bytes27.042 KiB
As a 24-bit colour#006C2B

Keep nerding

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

Nerdulate something else

Nothing in mind? Surprise me · today’s page

Every value on this page was computed from “27691” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.