# 5402 (number)

5,402 (five thousand four hundred two) is an even four-digits composite number following 5401 and preceding 5403. In scientific notation, it is written as 5.402 × 103. The sum of its digits is 11. It has a total of 3 prime factors and 8 positive divisors. There are 2,592 positive integers (up to 5402) that are relatively prime to 5402.

## Basic properties

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

## Name

Short name 5 thousand 402 five thousand four hundred two

## Notation

Scientific notation 5.402 × 103 5.402 × 103

## Prime Factorization of 5402

Prime Factorization 2 × 37 × 73

Composite number
Distinct Factors Total Factors Radical ω(n) 3 Total number of distinct prime factors Ω(n) 3 Total number of prime factors rad(n) 5402 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 5,402 is 2 × 37 × 73. Since it has a total of 3 prime factors, 5,402 is a composite number.

## Divisors of 5402

1, 2, 37, 73, 74, 146, 2701, 5402

8 divisors

 Even divisors 4 4 4 0
Total Divisors Sum of Divisors Aliquot Sum τ(n) 8 Total number of the positive divisors of n σ(n) 8436 Sum of all the positive divisors of n s(n) 3034 Sum of the proper positive divisors of n A(n) 1054.5 Returns the sum of divisors (σ(n)) divided by the total number of divisors (τ(n)) G(n) 73.4983 Returns the nth root of the product of n divisors H(n) 5.12281 Returns the total number of divisors (τ(n)) divided by the sum of the reciprocal of each divisors

The number 5,402 can be divided by 8 positive divisors (out of which 4 are even, and 4 are odd). The sum of these divisors (counting 5,402) is 8,436, the average is 105,4.5.

## Other Arithmetic Functions (n = 5402)

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

There are 2,592 positive integers (less than 5,402) that are coprime with 5,402. And there are approximately 719 prime numbers less than or equal to 5,402.

## Divisibility of 5402

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

The number 5,402 is divisible by 2.

• Deficient

• Polite

• Square Free

• Pronic
• Sphenic

## Base conversion (5402)

Base System Value
2 Binary 1010100011010
3 Ternary 21102002
4 Quaternary 1110122
5 Quinary 133102
6 Senary 41002
8 Octal 12432
10 Decimal 5402
12 Duodecimal 3162
20 Vigesimal da2
36 Base36 462

## Basic calculations (n = 5402)

### Multiplication

n×y
 n×2 10804 16206 21608 27010

### Division

n÷y
 n÷2 2701 1800.67 1350.5 1080.4

### Exponentiation

ny
 n2 29181604 157639024808 851566012012816 4600159596893232032

### Nth Root

y√n
 2√n 73.4983 17.5463 8.57311 5.57842

## 5402 as geometric shapes

### Circle

 Diameter 10804 33941.8 9.16767e+07

### Sphere

 Volume 6.60317e+11 3.66707e+08 33941.8

### Square

Length = n
 Perimeter 21608 2.91816e+07 7639.58

### Cube

Length = n
 Surface area 1.7509e+08 1.57639e+11 9356.54

### Equilateral Triangle

Length = n
 Perimeter 16206 1.2636e+07 4678.27

### Triangular Pyramid

Length = n
 Surface area 5.0544e+07 1.85779e+10 4410.71

## Cryptographic Hash Functions

md5 d1359f9934ee5a75ed441ffce412a0a1 1a33385fd41f2b6553d3904a944c9f7e400a18b5 0ff6f4bbfaf422d4f22d3e2b184c0b1eadaf695cd9c1ee70b09c260f08666ae4 b3cf4c0d312007d44b9fbe3671110513c3925afa9d3e366d9570c248213ee2a0c71dbc2439969da6d572b995b83ecbaaebbb615f6bcc78084874569e615e785d dc6acfea47c85626ee85e85e513163c470cc6f94
{"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}