Recognised as Number

32,770

Positive
Even
Composite
5 digits

32,770 is an even 5-digit integer and a composite number. It has 16 divisors and a digital root of 1.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value32,770

Digit count5

Digit sum19

Digit product0zero, because one of the digits is zero

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

Digital root1repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 5 × 29 × 113

Distinct prime factors42, 5, 29, 113

Number of divisors16

Sum of divisors σ(n)61,560

Aliquot sum28,790sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)112the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 12,544

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

SquarefreeYesno repeated prime factor

All divisors1, 2, 5, 10, 29, 58, 113, 145, 226, 290, 565, 1,130, 3,277, 6,554, 16,385, 32,77016 in total

Arithmetic

Previous number32,769

Next number32,771

Double65,540

Half16,385

Square1,073,872,900

Cube35,190,814,933,000

Square root181.024860171≈irrational, shown to 9 decimal places

Cube root32.000651028≈

Negation-32,770

Reciprocal0.0000305157≈

Representations

Decimal32,770

Binary100000000000001016 bits

Octal100002

Hexadecimal8002

Base 36PAA

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

In wordsthirty-two thousand, seven hundred and seventy

Ordinalthirty-two thousand, seven hundred and seventieth

Scientific notation3.277 × 10^4

Engineering notation32.77 × 10^3

In other bases

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

Quinary2022040base 5; one hand: 7 digits

Septenary164353base 7: 6 digits

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

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

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

Sexagesimal9:6:10base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

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

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

Bit-level

1000000000000010

Bit length16 bitsto write the magnitude

Set bits2the population count, or Hamming weight

Zero bits14within that length

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

Highest set bitbit 15worth 32,768

Lowest set bitbit 11 trailing zero

Power of twoNo

Bytes280 02

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

At each machine width

16-bit1000000000000010

32-bit00000000000000001000000000000010

64-bit0000000000000000000000000000000000000000000000001000000000000010

One's complement0111111111111101at 16 bits, every bit flipped

Bits reversed0100000000000001at 16 bits

Rotated left by 10000000000000101at 16 bits, wrapping

Shifted left by 110000000000000100= 65,540, no wrap

Shifted right by 1100000000000001= 16,385, discarding the low bit

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

Nearest landmarks

Next prime32,771+1

Previous prime32,749−21

Distance to nearest prime1

Nearest square below32,761

Nearest square above33,124

Powers & multiples

32,770 to the power 21,073,872,900

32,770 to the power 335,190,814,933,000

32,770 to the power 41,153,203,005,354,410,000

32,770 to the power 537,790,462,485,464,015,700,000

First ten multiples32,770, 65,540, 98,310, 131,080, 163,850, 196,620, 229,390, 262,160, 294,930, 327,700

Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)

Divisibility tests

Divisible by 2Yes

Divisible by 3No, remainder 1

Divisible by 4No, remainder 2

Divisible by 5Yes

Divisible by 6No, remainder 4

Divisible by 7No, remainder 3

Divisible by 8No, remainder 2

Divisible by 9No, remainder 1

Divisible by 10Yes

Divisible by 11No, remainder 1

Divisible by 12No, remainder 10

Divisible by 100No, remainder 70

Collatz (3n + 1) trajectory

Steps to reach 154the total stopping time

Highest value reached49,1561× the starting value

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

First steps32,770 → 16,385 → 49,156 → 24,578 → 12,289 → 36,868 → 18,434 → 9,217 → 27,652 → 13,826 → …

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

As a percentage & fraction

As a percentage3,277,000%

32,770% as a decimal327.7

32,770% of 10032,770

32,770% of 1,000327,700

As a fraction of 10032,770/100

Read another way

As seconds9 hours, 6 minutes and 10 seconds

As bytes32.002 KiB

As a 24-bit colour#008002

Keep nerding

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