# 30490 (number)

30,490 (thirty thousand four hundred ninety) is an even five-digits composite number following 30489 and preceding 30491. In scientific notation, it is written as 3.049 × 104. The sum of its digits is 16. It has a total of 3 prime factors and 8 positive divisors. There are 12,192 positive integers (up to 30490) that are relatively prime to 30490.

## Basic properties

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

## Name

Short name 30 thousand 490 thirty thousand four hundred ninety

## Notation

Scientific notation 3.049 × 104 30.49 × 103

## Prime Factorization of 30490

Prime Factorization 2 × 5 × 3049

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

## Divisors of 30490

1, 2, 5, 10, 3049, 6098, 15245, 30490

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) 54900 Sum of all the positive divisors of n s(n) 24410 Sum of the proper positive divisors of n A(n) 6862.5 Returns the sum of divisors (σ(n)) divided by the total number of divisors (τ(n)) G(n) 174.614 Returns the nth root of the product of n divisors H(n) 4.44299 Returns the total number of divisors (τ(n)) divided by the sum of the reciprocal of each divisors

The number 30,490 can be divided by 8 positive divisors (out of which 4 are even, and 4 are odd). The sum of these divisors (counting 30,490) is 54,900, the average is 686,2.5.

## Other Arithmetic Functions (n = 30490)

1 φ(n) n
Euler Totient Carmichael Lambda Prime Pi φ(n) 12192 Total number of positive integers not greater than n that are coprime to n λ(n) 3048 Smallest positive number such that aλ(n) ≡ 1 (mod n) for all a coprime to n π(n) ≈ 3296 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 12,192 positive integers (less than 30,490) that are coprime with 30,490. And there are approximately 3,296 prime numbers less than or equal to 30,490.

## Divisibility of 30490

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

The number 30,490 is divisible by 2 and 5.

• Deficient

• Polite

• Square Free

• Sphenic

## Base conversion (30490)

Base System Value
2 Binary 111011100011010
3 Ternary 1112211021
4 Quaternary 13130122
5 Quinary 1433430
6 Senary 353054
8 Octal 73432
10 Decimal 30490
12 Duodecimal 1578a
20 Vigesimal 3g4a
36 Base36 niy

## Basic calculations (n = 30490)

### Multiplication

n×y
 n×2 60980 91470 121960 152450

### Division

n÷y
 n÷2 15245 10163.3 7622.5 6098

### Exponentiation

ny
 n2 929640100 28344726649000 864230715528010000 26350394516449024900000

### Nth Root

y√n
 2√n 174.614 31.2406 13.2142 7.88554

## 30490 as geometric shapes

### Circle

 Diameter 60980 191574 2.92055e+09

### Sphere

 Volume 1.1873e+14 1.16822e+10 191574

### Square

Length = n
 Perimeter 121960 9.2964e+08 43119.4

### Cube

Length = n
 Surface area 5.57784e+09 2.83447e+13 52810.2

### Equilateral Triangle

Length = n
 Perimeter 91470 4.02546e+08 26405.1

### Triangular Pyramid

Length = n
 Surface area 1.61018e+09 3.34046e+12 24895

## Cryptographic Hash Functions

md5 3688c640bfeed975b53e4bca4d1b72b0 ad7f11a50bfa75710d6ee7440172281ac7b89a6d d9c7afd453fbf96b6424911c4c28f87f3876a69d2b375720e99d7b14fc7c9f2e 02a2c8cd82de66a291c46675b75b5536e60641e2624029de9260d21a970f09dfdc9b8a8900c892275cae54698684686acfb1cfc777292bf3df80e6e202f03fef 810705c3524dd92d2986ec368c2ee05f7e0a56ae
{"ft_lang_label":"__label__en","ft_lang_prob":0.6309973,"math_prob":0.98432475,"size":4584,"snap":"2022-40-2023-06","text_gpt3_token_len":1819,"char_repetition_ratio":0.12467249,"word_repetition_ratio":0.026200874,"special_character_ratio":0.45222512,"punctuation_ratio":0.0768262,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9955881,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2022-10-05T04:37:25Z\",\"WARC-Record-ID\":\"<urn:uuid:cc003cc5-fddb-4c62-b515-606bc0223368>\",\"Content-Length\":\"39860\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:7d78663c-ae80-49d0-85c0-3578ccc96566>\",\"WARC-Concurrent-To\":\"<urn:uuid:fa493564-c56d-4cb5-81c4-b1fa07dbb802>\",\"WARC-IP-Address\":\"46.105.53.190\",\"WARC-Target-URI\":\"https://metanumbers.com/30490\",\"WARC-Payload-Digest\":\"sha1:7SEP7OBJDHXFF2CAVGNWLCEZ6LPKITVY\",\"WARC-Block-Digest\":\"sha1:AFWU5HC27YMWITC7JMT7M5TBU7IFDYP6\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2022/CC-MAIN-2022-40/CC-MAIN-2022-40_segments_1664030337537.25_warc_CC-MAIN-20221005042446-20221005072446-00423.warc.gz\"}"}