Recognised as Number

27,207

Positive
Odd
Composite
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value27,207

Digit count5

Digit sum18

Digit product0zero, because one of the digits is zero

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

Digital root9repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3^2 × 3,023

Distinct prime factors23, 3,023

Number of divisors6

Sum of divisors σ(n)39,312

Aliquot sum12,105sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)9,066the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 18,132

Möbius function μ(n)0zero, because a prime divides n twice

SquarefreeNohas a repeated prime factor

All divisors1, 3, 9, 3,023, 9,069, 27,2076 in total

Arithmetic

Previous number27,206

Next number27,208

Double54,414

Half13,603.5

Square740,220,849

Cube20,139,188,638,743

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

Cube root30.076471571≈

Negation-27,207

Reciprocal0.0000367552≈

Representations

Decimal27,207

Binary11010100100011115 bits

Octal65107

Hexadecimal6A47

Base 36KZR

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

In wordstwenty-seven thousand, two hundred and seven

Ordinaltwenty-seven thousand, two hundred and seventh

Scientific notation2.7207 × 10^4

Engineering notation27.207 × 10^3

In other bases

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

Quinary1332312base 5; one hand: 7 digits

Septenary142215base 7: 6 digits

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

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

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

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

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

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

Bit-level

0110101001000111

Bit length15 bitsto write the magnitude

Set bits8the population count, or Hamming weight

Zero bits7within that length

Bit parityeven8 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 47

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

At each machine width

16-bit0110101001000111

32-bit00000000000000000110101001000111

64-bit0000000000000000000000000000000000000000000000000110101001000111

One's complement1001010110111000at 16 bits, every bit flipped

Bits reversed1110001001010110at 16 bits

Rotated left by 11101010010001110at 16 bits, wrapping

Shifted left by 11101010010001110= 54,414, no wrap

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

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

Nearest landmarks

Next prime27,211+4

Previous prime27,197−10

Distance to nearest prime4

Nearest square below26,896

Nearest square above27,225

Powers & multiples

27,207 to the power 2740,220,849

27,207 to the power 320,139,188,638,743

27,207 to the power 4547,926,905,294,280,801

27,207 to the power 514,907,447,312,341,497,752,807

First ten multiples27,207, 54,414, 81,621, 108,828, 136,035, 163,242, 190,449, 217,656, 244,863, 272,070

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

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3Yes

Divisible by 4No, remainder 3

Divisible by 5No, remainder 2

Divisible by 6No, remainder 3

Divisible by 7No, remainder 5

Divisible by 8No, remainder 7

Divisible by 9Yes

Divisible by 10No, remainder 7

Divisible by 11No, remainder 4

Divisible by 12No, remainder 3

Divisible by 100No, remainder 7

Collatz (3n + 1) trajectory

Steps to reach 138the total stopping time

Highest value reached183,6526× the starting value

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

First steps27,207 → 81,622 → 40,811 → 122,434 → 61,217 → 183,652 → 91,826 → 45,913 → 137,740 → 68,870 → …

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

As a percentage & fraction

As a percentage2,720,700%

27,207% as a decimal272.07

27,207% of 10027,207

27,207% of 1,000272,070

As a fraction of 10027,207/100

Read another way

As seconds7 hours, 33 minutes and 27 seconds

As bytes26.569 KiB

As a 24-bit colour#006A47

Keep nerding

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