## 15235

15,235 (fifteen thousand two hundred thirty-five) is an odd five-digits composite number following 15234 and preceding 15236. In scientific notation, it is written as 1.5235 × 104. The sum of its digits is 16. It has a total of 3 prime factors and 8 positive divisors. There are 11,040 positive integers (up to 15235) that are relatively prime to 15235.

## Basic properties

• Is Prime? No
• Number parity Odd
• Number length 5
• Sum of Digits 16
• Digital Root 7

## Name

Short name 15 thousand 235 fifteen thousand two hundred thirty-five

## Notation

Scientific notation 1.5235 × 104 15.235 × 103

## Prime Factorization of 15235

Prime Factorization 5 × 11 × 277

Composite number
Distinct Factors Total Factors Radical ω(n) 3 Total number of distinct prime factors Ω(n) 3 Total number of prime factors rad(n) 15235 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) 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 15,235 is 5 × 11 × 277. Since it has a total of 3 prime factors, 15,235 is a composite number.

## Divisors of 15235

1, 5, 11, 55, 277, 1385, 3047, 15235

8 divisors

 Even divisors 0 8 4 4
Total Divisors Sum of Divisors Aliquot Sum τ(n) 8 Total number of the positive divisors of n σ(n) 20016 Sum of all the positive divisors of n s(n) 4781 Sum of the proper positive divisors of n A(n) 2502 Returns the sum of divisors (σ(n)) divided by the total number of divisors (τ(n)) G(n) 123.43 Returns the nth root of the product of n divisors H(n) 6.08913 Returns the total number of divisors (τ(n)) divided by the sum of the reciprocal of each divisors

The number 15,235 can be divided by 8 positive divisors (out of which 0 are even, and 8 are odd). The sum of these divisors (counting 15,235) is 20,016, the average is 2,502.

## Other Arithmetic Functions (n = 15235)

1 φ(n) n
Euler Totient Carmichael Lambda Prime Pi φ(n) 11040 Total number of positive integers not greater than n that are coprime to n λ(n) 1380 Smallest positive number such that aλ(n) ≡ 1 (mod n) for all a coprime to n π(n) ≈ 1781 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 11,040 positive integers (less than 15,235) that are coprime with 15,235. And there are approximately 1,781 prime numbers less than or equal to 15,235.

## Divisibility of 15235

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

The number 15,235 is divisible by 5.

## Classification of 15235

• Arithmetic
• Deficient

• Polite

• Square Free

### Other numbers

• LucasCarmichael
• Sphenic

## Base conversion (15235)

Base System Value
2 Binary 11101110000011
3 Ternary 202220021
4 Quaternary 3232003
5 Quinary 441420
6 Senary 154311
8 Octal 35603
10 Decimal 15235
12 Duodecimal 8997
20 Vigesimal 1i1f
36 Base36 br7

## Basic calculations (n = 15235)

### Multiplication

n×i
 n×2 30470 45705 60940 76175

### Division

ni
 n⁄2 7617.5 5078.33 3808.75 3047

### Exponentiation

ni
 n2 232105225 3536123102875 53872835472300625 820752648420500021875

### Nth Root

i√n
 2√n 123.43 24.7902 11.1099 6.86386

## 15235 as geometric shapes

### Circle

 Diameter 30470 95724.3 7.2918e+08

### Sphere

 Volume 1.48121e+13 2.91672e+09 95724.3

### Square

Length = n
 Perimeter 60940 2.32105e+08 21545.5

### Cube

Length = n
 Surface area 1.39263e+09 3.53612e+12 26387.8

### Equilateral Triangle

Length = n
 Perimeter 45705 1.00505e+08 13193.9

### Triangular Pyramid

Length = n
 Surface area 4.02018e+08 4.16736e+11 12439.3

## Cryptographic Hash Functions

md5 8d80b953e6dab669d98c905f7527fedd 514a3c1b97d42f246d8db035ccbffe913fa77b02 74f0f8d0c988307804e913616fa0ae2243e4d2e8fbd4809864de05e0c9476029 5c2389d07fb44b52a2632356e38283c165541dd654b2b3ad2de918eb06d4091da73bedfb93a214ac5a118e321357c758fe82509a222f34f6ea27b4f3a8f30da7 2791f9efb9f46a967a9ed12fdec7dbec1a6e6092
{"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}