# 2232 (number)

2,232 (two thousand two hundred thirty-two) is an even four-digits composite number following 2231 and preceding 2233. In scientific notation, it is written as 2.232 × 103. The sum of its digits is 9. It has a total of 6 prime factors and 24 positive divisors. There are 720 positive integers (up to 2232) that are relatively prime to 2232.

## Basic properties

• Is Prime? No
• Number parity Even
• Number length 4
• Sum of Digits 9
• Digital Root 9

## Name

Short name 2 thousand 232 two thousand two hundred thirty-two

## Notation

Scientific notation 2.232 × 103 2.232 × 103

## Prime Factorization of 2232

Prime Factorization 23 × 32 × 31

Composite number
Distinct Factors Total Factors Radical ω(n) 3 Total number of distinct prime factors Ω(n) 6 Total number of prime factors rad(n) 186 Product of the distinct prime numbers λ(n) 1 Returns the parity of Ω(n), such that λ(n) = (-1)Ω(n) μ(n) 0 Returns: 1, if n has an even number of prime factors (and is square free) −1, if n has an odd number of prime factors (and is square free) 0, if n has a squared prime factor Λ(n) 0 Returns log(p) if n is a power pk of any prime p (for any k >= 1), else returns 0

The prime factorization of 2,232 is 23 × 32 × 31. Since it has a total of 6 prime factors, 2,232 is a composite number.

## Divisors of 2232

1, 2, 3, 4, 6, 8, 9, 12, 18, 24, 31, 36, 62, 72, 93, 124, 186, 248, 279, 372, 558, 744, 1116, 2232

24 divisors

 Even divisors 18 6 3 3
Total Divisors Sum of Divisors Aliquot Sum τ(n) 24 Total number of the positive divisors of n σ(n) 6240 Sum of all the positive divisors of n s(n) 4008 Sum of the proper positive divisors of n A(n) 260 Returns the sum of divisors (σ(n)) divided by the total number of divisors (τ(n)) G(n) 47.244 Returns the nth root of the product of n divisors H(n) 8.58462 Returns the total number of divisors (τ(n)) divided by the sum of the reciprocal of each divisors

The number 2,232 can be divided by 24 positive divisors (out of which 18 are even, and 6 are odd). The sum of these divisors (counting 2,232) is 6,240, the average is 260.

## Other Arithmetic Functions (n = 2232)

1 φ(n) n
Euler Totient Carmichael Lambda Prime Pi φ(n) 720 Total number of positive integers not greater than n that are coprime to n λ(n) 60 Smallest positive number such that aλ(n) ≡ 1 (mod n) for all a coprime to n π(n) ≈ 337 Total number of primes less than or equal to n r2(n) 0 The number of ways n can be represented as the sum of 2 squares

There are 720 positive integers (less than 2,232) that are coprime with 2,232. And there are approximately 337 prime numbers less than or equal to 2,232.

## Divisibility of 2232

 m n mod m 2 3 4 5 6 7 8 9 0 0 0 2 0 6 0 0

The number 2,232 is divisible by 2, 3, 4, 6, 8 and 9.

## Classification of 2232

• Arithmetic
• Refactorable
• Abundant

### Expressible via specific sums

• Polite
• Practical
• Non-hypotenuse

• Decagonal

## Base conversion (2232)

Base System Value
2 Binary 100010111000
3 Ternary 10001200
4 Quaternary 202320
5 Quinary 32412
6 Senary 14200
8 Octal 4270
10 Decimal 2232
12 Duodecimal 1360
20 Vigesimal 5bc
36 Base36 1q0

## Basic calculations (n = 2232)

### Multiplication

n×y
 n×2 4464 6696 8928 11160

### Division

n÷y
 n÷2 1116 744 558 446.4

### Exponentiation

ny
 n2 4981824 11119431168 24818570366976 55395049059090432

### Nth Root

y√n
 2√n 47.244 13.0687 6.87343 4.67454

## 2232 as geometric shapes

### Circle

 Diameter 4464 14024.1 1.56509e+07

### Sphere

 Volume 4.6577e+10 6.26034e+07 14024.1

### Square

Length = n
 Perimeter 8928 4.98182e+06 3156.52

### Cube

Length = n
 Surface area 2.98909e+07 1.11194e+10 3865.94

### Equilateral Triangle

Length = n
 Perimeter 6696 2.15719e+06 1932.97

### Triangular Pyramid

Length = n
 Surface area 8.62877e+06 1.31044e+09 1822.42

## Cryptographic Hash Functions

md5 3e6260b81898beacda3d16db379ed329 279ee41e61657cb1e3a12c39953f5795c6e11c7e 48fe0661615dd0a2fc9cf1b77111613b4c3e7fc857b7bf89e472c233a0b35eb0 c3839de2cd36ad7219e10090a804d2112c9dbc97abd9b183715f9749f5eaa91bc6e5aa9a3d6df293813f39dea2ac253f98c6cd11a565b541f651aa9428cbbb45 6d821631008e87f8c6255b41968bbf7525dc263c
{"found_math": false, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "url": "https://metanumbers.com/2232", "fetch_time": 1679579117000000000, "content_mime_type": "text/html", "warc_filename": "crawl-data/CC-MAIN-2023-14/segments/1679296945168.36/warc/CC-MAIN-20230323132026-20230323162026-00358.warc.gz", "warc_record_offset": 454957260, "warc_record_length": 7622, "token_count": 1510, "char_count": 4159, "score": 3.890625, "int_score": 4, "crawl": "CC-MAIN-2023-14", "snapshot_type": "latest", "language": "en", "language_score": 0.8016290068626404, "file_path": "/sailhome/yjruan/project/latent-lm/data/processed/finemath-4plus/finemath-4plus/train-00023-of-00064.parquet"}