Recognised as Number

27,572

Positive
Even
Composite
5 digits

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

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value27,572

Digit count5

Digit sum23

Digit product980

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

Digital root5repeated digit sum

PalindromicYesreads the same backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2^2 × 61 × 113

Distinct prime factors32, 61, 113

Number of divisors12

Sum of divisors σ(n)49,476

Aliquot sum21,904sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

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

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

SquarefreeNohas a repeated prime factor

All divisors1, 2, 4, 61, 113, 122, 226, 244, 452, 6,893, 13,786, 27,57212 in total

Arithmetic

Previous number27,571

Next number27,573

Double55,144

Half13,786

Square760,215,184

Cube20,960,653,053,248

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

Cube root30.210373174≈

Negation-27,572

Reciprocal0.0000362687≈

Representations

Decimal27,572

Binary11010111011010015 bits

Octal65664

Hexadecimal6BB4

Base 36L9W

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

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

Ordinaltwenty-seven thousand, five hundred and seventy-second

Scientific notation2.7572 × 10^4

Engineering notation27.572 × 10^3

In other bases

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

Quinary1340242base 5; one hand: 7 digits

Septenary143246base 7: 6 digits

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

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

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

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

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

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

Bit-level

0110101110110100

Bit length15 bitsto write the magnitude

Set bits9the population count, or Hamming weight

Zero bits6within that length

Bit parityodd9 set bits, so odd; not the same as the number itself being even

Highest set bitbit 14worth 16,384

Lowest set bitbit 22 trailing zeros

Power of twoNo

Bytes26b b4

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

At each machine width

16-bit0110101110110100

32-bit00000000000000000110101110110100

64-bit0000000000000000000000000000000000000000000000000110101110110100

One's complement1001010001001011at 16 bits, every bit flipped

Bits reversed0010110111010110at 16 bits

Rotated left by 11101011101101000at 16 bits, wrapping

Shifted left by 11101011101101000= 55,144, no wrap

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

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

Nearest landmarks

Next prime27,581+9

Previous prime27,551−21

Distance to nearest prime9

Nearest square below27,556

Nearest square above27,889

Powers & multiples

27,572 to the power 2760,215,184

27,572 to the power 320,960,653,053,248

27,572 to the power 4577,927,125,984,153,856

27,572 to the power 515,934,606,717,635,090,117,632

First ten multiples27,572, 55,144, 82,716, 110,288, 137,860, 165,432, 193,004, 220,576, 248,148, 275,720

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

Divisibility tests

Divisible by 2Yes

Divisible by 3No, remainder 2

Divisible by 4Yes

Divisible by 5No, remainder 2

Divisible by 6No, remainder 2

Divisible by 7No, remainder 6

Divisible by 8No, remainder 4

Divisible by 9No, remainder 5

Divisible by 10No, remainder 2

Divisible by 11No, remainder 6

Divisible by 12No, remainder 8

Divisible by 100No, remainder 72

Collatz (3n + 1) trajectory

Steps to reach 159the total stopping time

Highest value reached27,572

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

First steps27,572 → 13,786 → 6,893 → 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,200%

27,572% as a decimal275.72

27,572% of 10027,572

27,572% of 1,000275,720

As a fraction of 10027,572/100

Read another way

As seconds7 hours, 39 minutes and 32 seconds

As bytes26.926 KiB

As a 24-bit colour#006BB4

Keep nerding

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