Recognised as Number

32,373

Positive
Odd
Composite
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value32,373

Digit count5

Digit sum18

Digit product378

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

Digital root9repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3^3 × 11 × 109

Distinct prime factors33, 11, 109

Number of divisors16

Sum of divisors σ(n)52,800

Aliquot sum20,427sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

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

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

SquarefreeNohas a repeated prime factor

All divisors1, 3, 9, 11, 27, 33, 99, 109, 297, 327, 981, 1,199, 2,943, 3,597, 10,791, 32,37316 in total

Arithmetic

Previous number32,372

Next number32,374

Double64,746

Half16,186.5

Square1,048,011,129

Cube33,927,264,279,117

Square root179.924984368≈irrational, shown to 9 decimal places

Cube root31.870899126≈

Negation-32,373

Reciprocal0.0000308899≈

Representations

Decimal32,373

Binary11111100111010115 bits

Octal77165

Hexadecimal7E75

Base 36OZ9

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

In wordsthirty-two thousand, three hundred and seventy-three

Ordinalthirty-two thousand, three hundred and seventy-third

Scientific notation3.2373 × 10^4

Engineering notation32.373 × 10^3

In other bases

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

Quinary2013443base 5; one hand: 7 digits

Septenary163245base 7: 6 digits

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

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

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

Sexagesimal8:59:33base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

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

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

Bit-level

0111111001110101

Bit length15 bitsto write the magnitude

Set bits11the population count, or Hamming weight

Zero bits4within that length

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

Highest set bitbit 14worth 16,384

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes27e 75

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

At each machine width

16-bit0111111001110101

32-bit00000000000000000111111001110101

64-bit0000000000000000000000000000000000000000000000000111111001110101

One's complement1000000110001010at 16 bits, every bit flipped

Bits reversed1010111001111110at 16 bits

Rotated left by 11111110011101010at 16 bits, wrapping

Shifted left by 11111110011101010= 64,746, no wrap

Shifted right by 111111100111010= 16,186, discarding the low bit

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

Nearest landmarks

Next prime32,377+4

Previous prime32,371−2

Distance to nearest prime2

Nearest square below32,041

Nearest square above32,400

Powers & multiples

32,373 to the power 21,048,011,129

32,373 to the power 333,927,264,279,117

32,373 to the power 41,098,327,326,507,854,641

32,373 to the power 535,556,150,541,038,778,293,093

First ten multiples32,373, 64,746, 97,119, 129,492, 161,865, 194,238, 226,611, 258,984, 291,357, 323,730

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 3

Divisible by 6No, remainder 3

Divisible by 7No, remainder 5

Divisible by 8No, remainder 5

Divisible by 9Yes

Divisible by 10No, remainder 3

Divisible by 11Yes

Divisible by 12No, remainder 9

Divisible by 100No, remainder 73

Collatz (3n + 1) trajectory

Steps to reach 1160the total stopping time

Highest value reached97,1203× the starting value

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

First steps32,373 → 97,120 → 48,560 → 24,280 → 12,140 → 6,070 → 3,035 → 9,106 → 4,553 → 13,660 → …

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

As a percentage & fraction

As a percentage3,237,300%

32,373% as a decimal323.73

32,373% of 10032,373

32,373% of 1,000323,730

As a fraction of 10032,373/100

Read another way

As seconds8 hours, 59 minutes and 33 seconds

As bytes31.614 KiB

As a 24-bit colour#007E75

Keep nerding

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