Nerdulator> put something in

Recognised as Number

32,549

  • Positive
  • Odd
  • Composite
  • 5 digits

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

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value32,549
Digit count5
Digit sum23
Digit product1,080
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation11^2 × 269
Distinct prime factors211, 269
Number of divisors6
Sum of divisors σ(n)35,910
Aliquot sum3,361sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)29,480integers below n that share no factor with it
Carmichael function λ(n)14,740the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 29,480
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 11, 121, 269, 2,959, 32,5496 in total

Arithmetic

Previous number32,548
Next number32,550
Double65,098
Square root180.413414135≈irrational, shown to 9 decimal places
Cube root31.928551529≈
Negation-32,549
Reciprocal0.0000307229≈

Representations

Decimal32,549
Binary11111110010010115 bits
Octal77445
Hexadecimal7F25
Base 36P45
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthirty-two thousand, five hundred and forty-nine
Ordinalthirty-two thousand, five hundred and forty-ninth
Scientific notation3.2549 × 10^4
Engineering notation32.549 × 10^3

In other bases

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

Bit-level

0111111100100101
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 25
Gray code100000010110111n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit0111111100100101
32-bit00000000000000000111111100100101
64-bit0000000000000000000000000000000000000000000000000111111100100101
One's complement1000000011011010at 16 bits, every bit flipped
Bits reversed1010010011111110at 16 bits
Rotated left by 11111111001001010at 16 bits, wrapping
Shifted left by 11111111001001010= 65,098, no wrap
Shifted right by 111111110010010= 16,274, discarding the low bit
These bits as a double1.60813427 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime32,561+12
Previous prime32,537−12
Distance to nearest prime12
Nearest square below32,400
Nearest square above32,761

Powers & multiples

32,549 to the power 21,059,437,401
32,549 to the power 334,483,627,965,149
32,549 to the power 41,122,407,606,637,634,801
32,549 to the power 536,533,245,188,448,375,137,749
First ten multiples32,549, 65,098, 97,647, 130,196, 162,745, 195,294, 227,843, 260,392, 292,941, 325,490
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 4
Divisible by 6No, remainder 5
Divisible by 7No, remainder 6
Divisible by 8No, remainder 5
Divisible by 9No, remainder 5
Divisible by 10No, remainder 9
Divisible by 11Yes
Divisible by 12No, remainder 5
Divisible by 100No, remainder 49

Collatz (3n + 1) trajectory

Steps to reach 1160the total stopping time
Highest value reached97,6483× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps32,549 → 97,648 → 48,824 → 24,412 → 12,206 → 6,103 → 18,310 → 9,155 → 27,466 → 13,733 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage3,254,900%
32,549% as a decimal325.49
32,549% of 10032,549
32,549% of 1,000325,490
As a fraction of 10032,549/100

Read another way

As bytes31.786 KiB
As a 24-bit colour#007F25

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