1063 (number)

1063 is an odd four-digits prime number following 1062 and preceding 1064. In scientific notation, it is written as 1.063 × 103. The sum of its digits is 10. It has a total of one prime factor and 2 positive divisors. There are 1,062 positive integers (up to 1063) that are relatively prime to 1063.

Basic properties

• Is Prime? yes
• Number parity odd
• Number length 4
• Sum of Digits 10
• Digital Root 1

Name

Name one thousand sixty-three

Notation

Scientific notation 1.063 × 103 1.063 × 103

Prime Factorization of 1063

Prime Factorization 1063

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

The prime factorization of 1063 is 1063. Since it has only one prime factor, 1063 is a prime number.

Divisors of 1063

2 divisors

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

The number 1063 can be divided by 2 positive divisors (out of which none is even, and 2 are odd). The sum of these divisors (counting 1063) is 1064, the average is 532.

Other Arithmetic Functions (n = 1063)

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

There are 1,062 positive integers (less than 1063) that are coprime with 1063. And there are approximately 180 prime numbers less than or equal to 1063.

Divisibility of 1063

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

1063 is not divisible by any number less than or equal to 9.

Classification of 1063

• Arithmetic
• Prime
• Deficient

Expressible via specific sums

• Polite
• Non hypotenuse

• Prime Power
• Square Free

Base conversion 1063

Base System Value
2 Binary 10000100111
3 Ternary 1110101
4 Quaternary 100213
5 Quinary 13223
6 Senary 4531
8 Octal 2047
10 Decimal 1063
12 Duodecimal 747
20 Vigesimal 2d3
36 Base36 tj

Basic calculations (n = 1063)

Multiplication

n×y
 n×2 2126 3189 4252 5315

Division

n÷y
 n÷2 531.5 354.333 265.75 212.6

Exponentiation

ny
 n2 1129969 1201157047 1276829940961 1357270227241543

Nth Root

y√n
 2√n 32.6037 10.2057 5.70996 4.03001

1063 as geometric shapes

Circle

 Diameter 2126 6679.03 3.5499e+06

Sphere

 Volume 5.03139e+09 1.41996e+07 6679.03

Square

Length = n
 Perimeter 4252 1.12997e+06 1503.31

Cube

Length = n
 Surface area 6.77981e+06 1.20116e+09 1841.17

Equilateral Triangle

Length = n
 Perimeter 3189 489291 920.585

Triangular Pyramid

Length = n
 Surface area 1.95716e+06 1.41558e+08 867.936

Cryptographic Hash Functions

md5 6c340f25839e6acdc73414517203f5f0 578d9283ca503d77b707716d16f3ae71036236d2 0fe39b99b379952df916ed88c169ec63757291bf0c3db2881a4e0e9bf84b1463 6bd95288e49d217123708530b021abdbc8111fff7ed8c4c97f2800b02bfd96ab4da7dab0a9dfacb8799ab5720ea99133dc4b1b96783afd6d02db147b21fa9615 2eac2d6ac71d8c9e8265d8ad4ee2b79c3333f3d4
{"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/1063", "fetch_time": 1709562191000000000, "content_mime_type": "text/html", "warc_filename": "crawl-data/CC-MAIN-2024-10/segments/1707947476452.25/warc/CC-MAIN-20240304133241-20240304163241-00239.warc.gz", "warc_record_offset": 386380323, "warc_record_length": 7341, "token_count": 1331, "char_count": 3826, "score": 3.84375, "int_score": 4, "crawl": "CC-MAIN-2024-10", "snapshot_type": "latest", "language": "en", "language_score": 0.842523455619812, "file_path": "/sailhome/yjruan/project/latent-lm/data/processed/finemath-4plus/finemath-4plus/train-00042-of-00064.parquet"}