Nerdulator> put something in

Recognised as Number

32,537

  • Positive
  • Odd
  • Prime
  • 5 digits

32,537 is an odd 5-digit integer and a prime number. It has 2 divisors and a digital root of 2.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value32,537
Digit count5
Digit sum20
Digit product630
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation32,537
Distinct prime factors132,537
Number of divisors2
Sum of divisors σ(n)32,538
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)32,536integers below n that share no factor with it
Carmichael function λ(n)32,536the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)−11 distinct prime factor, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 32,5372 in total

Arithmetic

Previous number32,536
Next number32,538
Double65,074
Square root180.380154119≈irrational, shown to 9 decimal places
Cube root31.924627294≈
Negation-32,537
Reciprocal0.0000307342≈

Representations

Decimal32,537
Binary11111110001100115 bits
Octal77431
Hexadecimal7F19
Base 36P3T
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthirty-two thousand, five hundred and thirty-seven
Ordinalthirty-two thousand, five hundred and thirty-seventh
Scientific notation3.2537 × 10^4
Engineering notation32.537 × 10^3

In other bases

Ternary1122122002base 3; the most digit-efficient integer base after e: 10 digits
Quinary2020122base 5; one hand: 7 digits
Septenary163601base 7: 6 digits
Nonary48562base 9; each digit is two ternary digits: 5 digits
Duodecimal169b5base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal416hbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal9:2:17base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1TT00T0T01Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11000001101101001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

0111111100011001
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
Bytes27f 19
Gray code100000010010101n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit0111111100011001
32-bit00000000000000000111111100011001
64-bit0000000000000000000000000000000000000000000000000111111100011001
One's complement1000000011100110at 16 bits, every bit flipped
Bits reversed1001100011111110at 16 bits
Rotated left by 11111111000110010at 16 bits, wrapping
Shifted left by 11111111000110010= 65,074, no wrap
Shifted right by 111111110001100= 16,268, discarding the low bit
These bits as a double1.60754139 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime32,561+24
Previous prime32,533−4
Distance to nearest prime0, it is prime
Nearest square below32,400
Nearest square above32,761

Powers & multiples

32,537 to the power 21,058,656,369
32,537 to the power 334,445,502,278,153
32,537 to the power 41,120,753,307,624,264,161
32,537 to the power 536,465,950,370,170,683,006,457
First ten multiples32,537, 65,074, 97,611, 130,148, 162,685, 195,222, 227,759, 260,296, 292,833, 325,370
Powers of twoBetween 2^14 (16,384) and 2^15 (32,768)

Divisibility tests

Divisible by 2No, remainder 1
Divisible by 3No, remainder 2
Divisible by 4No, remainder 1
Divisible by 5No, remainder 2
Divisible by 6No, remainder 5
Divisible by 7No, remainder 1
Divisible by 8No, remainder 1
Divisible by 9No, remainder 2
Divisible by 10No, remainder 7
Divisible by 11No, remainder 10
Divisible by 12No, remainder 5
Divisible by 100No, remainder 37

Collatz (3n + 1) trajectory

Steps to reach 198the total stopping time
Highest value reached593,72818× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps32,537 → 97,612 → 48,806 → 24,403 → 73,210 → 36,605 → 109,816 → 54,908 → 27,454 → 13,727 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage3,253,700%
32,537% as a decimal325.37
32,537% of 10032,537
32,537% of 1,000325,370
As a fraction of 10032,537/100

Read another way

As bytes31.774 KiB
As a 24-bit colour#007F19

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 “32537” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.