Recognised as Number

27,206

Positive
Even
Composite
5 digits

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

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value27,206

Digit count5

Digit sum17

Digit product0zero, because one of the digits is zero

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

Digital root8repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 61 × 223

Distinct prime factors32, 61, 223

Number of divisors8

Sum of divisors σ(n)41,664

Aliquot sum14,458sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)2,220the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 13,320

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

SquarefreeYesno repeated prime factor

All divisors1, 2, 61, 122, 223, 446, 13,603, 27,2068 in total

Arithmetic

Previous number27,205

Next number27,207

Double54,412

Half13,603

Square740,166,436

Cube20,136,968,057,816

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

Cube root30.076103077≈

Negation-27,206

Reciprocal0.0000367566≈

Representations

Decimal27,206

Binary11010100100011015 bits

Octal65106

Hexadecimal6A46

Base 36KZQ

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

In wordstwenty-seven thousand, two hundred and six

Ordinaltwenty-seven thousand, two hundred and sixth

Scientific notation2.7206 × 10^4

Engineering notation27.206 × 10^3

In other bases

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

Quinary1332311base 5; one hand: 7 digits

Septenary142214base 7: 6 digits

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

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

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

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

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

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

Bit-level

0110101001000110

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 even

Highest set bitbit 14worth 16,384

Lowest set bitbit 11 trailing zero

Power of twoNo

Bytes26a 46

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

At each machine width

16-bit0110101001000110

32-bit00000000000000000110101001000110

64-bit0000000000000000000000000000000000000000000000000110101001000110

One's complement1001010110111001at 16 bits, every bit flipped

Bits reversed0110001001010110at 16 bits

Rotated left by 11101010010001100at 16 bits, wrapping

Shifted left by 11101010010001100= 54,412, no wrap

Shifted right by 111010100100011= 13,603, discarding the low bit

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

Nearest landmarks

Next prime27,211+5

Previous prime27,197−9

Distance to nearest prime5

Nearest square below26,896

Nearest square above27,225

Powers & multiples

27,206 to the power 2740,166,436

27,206 to the power 320,136,968,057,816

27,206 to the power 4547,846,352,980,942,096

27,206 to the power 514,904,707,879,199,510,663,776

First ten multiples27,206, 54,412, 81,618, 108,824, 136,030, 163,236, 190,442, 217,648, 244,854, 272,060

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

Divisibility tests

Divisible by 2Yes

Divisible by 3No, remainder 2

Divisible by 4No, remainder 2

Divisible by 5No, remainder 1

Divisible by 6No, remainder 2

Divisible by 7No, remainder 4

Divisible by 8No, remainder 6

Divisible by 9No, remainder 8

Divisible by 10No, remainder 6

Divisible by 11No, remainder 3

Divisible by 12No, remainder 2

Divisible by 100No, remainder 6

Collatz (3n + 1) trajectory

Steps to reach 190the total stopping time

Highest value reached61,2162× the starting value

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

First steps27,206 → 13,603 → 40,810 → 20,405 → 61,216 → 30,608 → 15,304 → 7,652 → 3,826 → 1,913 → …

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

As a percentage & fraction

As a percentage2,720,600%

27,206% as a decimal272.06

27,206% of 10027,206

27,206% of 1,000272,060

As a fraction of 10027,206/100

Read another way

As seconds7 hours, 33 minutes and 26 seconds

As bytes26.568 KiB

As a 24-bit colour#006A46

Keep nerding

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