Recognised as Number

27,573

Positive
Odd
Composite
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value27,573

Digit count5

Digit sum24

Digit product1,470

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

Digital root6repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3 × 7 × 13 × 101

Distinct prime factors43, 7, 13, 101

Number of divisors16

Sum of divisors σ(n)45,696

Aliquot sum18,123sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)300the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 14,400

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

SquarefreeYesno repeated prime factor

All divisors1, 3, 7, 13, 21, 39, 91, 101, 273, 303, 707, 1,313, 2,121, 3,939, 9,191, 27,57316 in total

Arithmetic

Previous number27,572

Next number27,574

Double55,146

Half13,786.5

Square760,270,329

Cube20,962,933,781,517

Square root166.051196924≈irrational, shown to 9 decimal places

Cube root30.2107384≈

Negation-27,573

Reciprocal0.0000362674≈

Representations

Decimal27,573

Binary11010111011010115 bits

Octal65665

Hexadecimal6BB5

Base 36L9X

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

In wordstwenty-seven thousand, five hundred and seventy-three

Ordinaltwenty-seven thousand, five hundred and seventy-third

Scientific notation2.7573 × 10^4

Engineering notation27.573 × 10^3

In other bases

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

Quinary1340243base 5; one hand: 7 digits

Septenary143250base 7: 6 digits

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

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

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

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

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

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

Bit-level

0110101110110101

Bit length15 bitsto write the magnitude

Set bits10the population count, or Hamming weight

Zero bits5within that length

Bit parityeven10 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

Bytes26b b5

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

At each machine width

16-bit0110101110110101

32-bit00000000000000000110101110110101

64-bit0000000000000000000000000000000000000000000000000110101110110101

One's complement1001010001001010at 16 bits, every bit flipped

Bits reversed1010110111010110at 16 bits

Rotated left by 11101011101101010at 16 bits, wrapping

Shifted left by 11101011101101010= 55,146, no wrap

Shifted right by 111010111011010= 13,786, discarding the low bit

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

Nearest landmarks

Next prime27,581+8

Previous prime27,551−22

Distance to nearest prime8

Nearest square below27,556

Nearest square above27,889

Powers & multiples

27,573 to the power 2760,270,329

27,573 to the power 320,962,933,781,517

27,573 to the power 4578,010,973,157,768,241

27,573 to the power 515,937,496,562,879,143,709,093

First ten multiples27,573, 55,146, 82,719, 110,292, 137,865, 165,438, 193,011, 220,584, 248,157, 275,730

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 1

Divisible by 5No, remainder 3

Divisible by 6No, remainder 3

Divisible by 7Yes

Divisible by 8No, remainder 5

Divisible by 9No, remainder 6

Divisible by 10No, remainder 3

Divisible by 11No, remainder 7

Divisible by 12No, remainder 9

Divisible by 100No, remainder 73

Collatz (3n + 1) trajectory

Steps to reach 159the total stopping time

Highest value reached82,7203× the starting value

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

First steps27,573 → 82,720 → 41,360 → 20,680 → 10,340 → 5,170 → 2,585 → 7,756 → 3,878 → 1,939 → …

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

As a percentage & fraction

As a percentage2,757,300%

27,573% as a decimal275.73

27,573% of 10027,573

27,573% of 1,000275,730

As a fraction of 10027,573/100

Read another way

As seconds7 hours, 39 minutes and 33 seconds

As bytes26.927 KiB

As a 24-bit colour#006BB5

Keep nerding

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