Recognised as Number

27,205

Positive
Odd
Composite
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value27,205

Digit count5

Digit sum16

Digit product0zero, because one of the digits is zero

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

Digital root7repeated digit sum

PalindromicNoreads differently backwards

Happy numberYessquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation5 × 5,441

Distinct prime factors25, 5,441

Number of divisors4

Sum of divisors σ(n)32,652

Aliquot sum5,447sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

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

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

SquarefreeYesno repeated prime factor

All divisors1, 5, 5,441, 27,2054 in total

Arithmetic

Previous number27,204

Next number27,206

Double54,410

Half13,602.5

Square740,112,025

Cube20,134,747,640,125

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

Cube root30.075734574≈

Negation-27,205

Reciprocal0.0000367579≈

Representations

Decimal27,205

Binary11010100100010115 bits

Octal65105

Hexadecimal6A45

Base 36KZP

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

In wordstwenty-seven thousand, two hundred and five

Ordinaltwenty-seven thousand, two hundred and fifth

Scientific notation2.7205 × 10^4

Engineering notation27.205 × 10^3

In other bases

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

Quinary1332310base 5; one hand: 7 digits

Septenary142213base 7: 6 digits

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

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

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

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

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

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

Bit-level

0110101001000101

Bit length15 bitsto write the magnitude

Set bits7the population count, or Hamming weight

Zero bits8within that length

Bit parityodd7 set bits, so odd; 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 45

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

At each machine width

16-bit0110101001000101

32-bit00000000000000000110101001000101

64-bit0000000000000000000000000000000000000000000000000110101001000101

One's complement1001010110111010at 16 bits, every bit flipped

Bits reversed1010001001010110at 16 bits

Rotated left by 11101010010001010at 16 bits, wrapping

Shifted left by 11101010010001010= 54,410, no wrap

Shifted right by 111010100100010= 13,602, discarding the low bit

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

Nearest landmarks

Next prime27,211+6

Previous prime27,197−8

Distance to nearest prime6

Nearest square below26,896

Nearest square above27,225

Powers & multiples

27,205 to the power 2740,112,025

27,205 to the power 320,134,747,640,125

27,205 to the power 4547,765,809,549,600,625

27,205 to the power 514,901,968,848,796,885,003,125

First ten multiples27,205, 54,410, 81,615, 108,820, 136,025, 163,230, 190,435, 217,640, 244,845, 272,050

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 1

Divisible by 5Yes

Divisible by 6No, remainder 1

Divisible by 7No, remainder 3

Divisible by 8No, remainder 5

Divisible by 9No, remainder 7

Divisible by 10No, remainder 5

Divisible by 11No, remainder 2

Divisible by 12No, remainder 1

Divisible by 100No, remainder 5

Collatz (3n + 1) trajectory

Steps to reach 190the total stopping time

Highest value reached81,6163× the starting value

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

First steps27,205 → 81,616 → 40,808 → 20,404 → 10,202 → 5,101 → 15,304 → 7,652 → 3,826 → 1,913 → …

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

As a percentage & fraction

As a percentage2,720,500%

27,205% as a decimal272.05

27,205% of 10027,205

27,205% of 1,000272,050

As a fraction of 10027,205/100

Read another way

As seconds7 hours, 33 minutes and 25 seconds

As bytes26.567 KiB

As a 24-bit colour#006A45

Keep nerding

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