# 132233 (number)

132,233 (one hundred thirty-two thousand two hundred thirty-three) is an odd six-digits prime number following 132232 and preceding 132234. In scientific notation, it is written as 1.32233 × 105. The sum of its digits is 14. It has a total of 1 prime factor and 2 positive divisors. There are 132,232 positive integers (up to 132233) that are relatively prime to 132233.

## Basic properties

• Is Prime? Yes
• Number parity Odd
• Number length 6
• Sum of Digits 14
• Digital Root 5

## Name

Short name 132 thousand 233 one hundred thirty-two thousand two hundred thirty-three

## Notation

Scientific notation 1.32233 × 105 132.233 × 103

## Prime Factorization of 132233

Prime Factorization 132233

Prime number
Distinct Factors Total Factors Radical ω(n) 1 Total number of distinct prime factors Ω(n) 1 Total number of prime factors rad(n) 132233 Product of the distinct prime numbers λ(n) -1 Returns the parity of Ω(n), such that λ(n) = (-1)Ω(n) μ(n) -1 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) 11.7923 Returns log(p) if n is a power pk of any prime p (for any k >= 1), else returns 0

The prime factorization of 132,233 is 132233. Since it has a total of 1 prime factor, 132,233 is a prime number.

## Divisors of 132233

2 divisors

 Even divisors 0 2 2 0
Total Divisors Sum of Divisors Aliquot Sum τ(n) 2 Total number of the positive divisors of n σ(n) 132234 Sum of all the positive divisors of n s(n) 1 Sum of the proper positive divisors of n A(n) 66117 Returns the sum of divisors (σ(n)) divided by the total number of divisors (τ(n)) G(n) 363.639 Returns the nth root of the product of n divisors H(n) 1.99998 Returns the total number of divisors (τ(n)) divided by the sum of the reciprocal of each divisors

The number 132,233 can be divided by 2 positive divisors (out of which 0 are even, and 2 are odd). The sum of these divisors (counting 132,233) is 132,234, the average is 66,117.

## Other Arithmetic Functions (n = 132233)

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

There are 132,232 positive integers (less than 132,233) that are coprime with 132,233. And there are approximately 12,317 prime numbers less than or equal to 132,233.

## Divisibility of 132233

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

132,233 is not divisible by any number less than or equal to 9.

• Arithmetic
• Prime
• Deficient

• Polite

• Prime Power
• Square Free

## Base conversion (132233)

Base System Value
2 Binary 100000010010001001
3 Ternary 20201101112
4 Quaternary 200102021
5 Quinary 13212413
6 Senary 2500105
8 Octal 402211
10 Decimal 132233
12 Duodecimal 64635
20 Vigesimal gabd
36 Base36 2u15

## Basic calculations (n = 132233)

### Multiplication

n×y
 n×2 264466 396699 528932 661165

### Division

n÷y
 n÷2 66116.5 44077.7 33058.2 26446.6

### Exponentiation

ny
 n2 17485566289 2312168887093337 305745028447013231521 40429582346633900643716393

### Nth Root

y√n
 2√n 363.639 50.9464 19.0693 10.5747

## 132233 as geometric shapes

### Circle

 Diameter 264466 830844 5.49325e+10

### Sphere

 Volume 9.68519e+15 2.1973e+11 830844

### Square

Length = n
 Perimeter 528932 1.74856e+10 187006

### Cube

Length = n
 Surface area 1.04913e+11 2.31217e+15 229034

### Equilateral Triangle

Length = n
 Perimeter 396699 7.57147e+09 114517

### Triangular Pyramid

Length = n
 Surface area 3.02859e+10 2.72492e+14 107968
{"ft_lang_label":"__label__en","ft_lang_prob":0.6339373,"math_prob":0.99446917,"size":4641,"snap":"2021-31-2021-39","text_gpt3_token_len":1625,"char_repetition_ratio":0.12486521,"word_repetition_ratio":0.032448377,"special_character_ratio":0.45787546,"punctuation_ratio":0.07614213,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99905676,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-09-27T04:34:09Z\",\"WARC-Record-ID\":\"<urn:uuid:9db11b77-5b74-49c9-ade1-f30d5d1c85b8>\",\"Content-Length\":\"39598\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:95a73533-029e-4c35-820c-a59d9f4b8d8e>\",\"WARC-Concurrent-To\":\"<urn:uuid:17a83a90-fc10-4bd2-ace4-e2f3cedf385c>\",\"WARC-IP-Address\":\"46.105.53.190\",\"WARC-Target-URI\":\"https://metanumbers.com/132233\",\"WARC-Payload-Digest\":\"sha1:AS4WQZ65WC7WBJFIGB3GCB5HDA36SFND\",\"WARC-Block-Digest\":\"sha1:GAZABKWDCJZTKHJVPFWSQXQBLPDTP2H5\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-39/CC-MAIN-2021-39_segments_1631780058263.20_warc_CC-MAIN-20210927030035-20210927060035-00489.warc.gz\"}"}