Nerdulator> put something in

Recognised as Number

27,537

  • Positive
  • Odd
  • Composite
  • 5 digits

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

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value27,537
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 × 67 × 137
Distinct prime factors33, 67, 137
Number of divisors8
Sum of divisors σ(n)37,536
Aliquot sum9,999sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)17,952integers below n that share no factor with it
Carmichael function λ(n)4,488the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 17,952
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 3, 67, 137, 201, 411, 9,179, 27,5378 in total

Arithmetic

Previous number27,536
Next number27,538
Double55,074
Square root165.942761216≈irrational, shown to 9 decimal places
Cube root30.197584708≈
Negation-27,537
Reciprocal0.0000363148≈

Representations

Decimal27,537
Binary11010111001000115 bits
Octal65621
Hexadecimal6B91
Base 36L8X
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwenty-seven thousand, five hundred and thirty-seven
Ordinaltwenty-seven thousand, five hundred and thirty-seventh
Scientific notation2.7537 × 10^4
Engineering notation27.537 × 10^3

In other bases

Ternary1101202220base 3; the most digit-efficient integer base after e: 10 digits
Quinary1340122base 5; one hand: 7 digits
Septenary143166base 7: 6 digits
Nonary41686base 9; each digit is two ternary digits: 5 digits
Duodecimal13b29base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal38ghbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal7:38:57base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary111TT100T0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11011110010010001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

0110101110010001
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
Bytes26b 91
Gray code101111001011001n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit0110101110010001
32-bit00000000000000000110101110010001
64-bit0000000000000000000000000000000000000000000000000110101110010001
One's complement1001010001101110at 16 bits, every bit flipped
Bits reversed1000100111010110at 16 bits
Rotated left by 11101011100100010at 16 bits, wrapping
Shifted left by 11101011100100010= 55,074, no wrap
Shifted right by 111010111001000= 13,768, discarding the low bit
These bits as a double1.36050857 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime27,539+2
Previous prime27,529−8
Distance to nearest prime2
Nearest square below27,225
Nearest square above27,556

Powers & multiples

27,537 to the power 2758,286,369
27,537 to the power 320,880,931,743,153
27,537 to the power 4574,998,217,411,204,161
27,537 to the power 515,833,725,912,852,328,981,457
First ten multiples27,537, 55,074, 82,611, 110,148, 137,685, 165,222, 192,759, 220,296, 247,833, 275,370
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 2
Divisible by 6No, remainder 3
Divisible by 7No, remainder 6
Divisible by 8No, remainder 1
Divisible by 9No, remainder 6
Divisible by 10No, remainder 7
Divisible by 11No, remainder 4
Divisible by 12No, remainder 9
Divisible by 100No, remainder 37

Collatz (3n + 1) trajectory

Steps to reach 159the total stopping time
Highest value reached82,6123× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps27,537 → 82,612 → 41,306 → 20,653 → 61,960 → 30,980 → 15,490 → 7,745 → 23,236 → 11,618 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage2,753,700%
27,537% as a decimal275.37
27,537% of 10027,537
27,537% of 1,000275,370
As a fraction of 10027,537/100

Read another way

As bytes26.892 KiB
As a 24-bit colour#006B91

Keep nerding

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

Nerdulate something else

Nothing in mind? Surprise me · today’s page

Every value on this page was computed from “27537” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.