Base | Representation |
---|---|
bin | 111101011011110… |
… | …100111110110001 |
3 | 2122211110020112222 |
4 | 331123310332301 |
5 | 4102330030243 |
6 | 250135330425 |
7 | 34353564026 |
oct | 7533647661 |
9 | 2584406488 |
10 | 1030705073 |
11 | 489895a82 |
12 | 249220a15 |
13 | 1356cb078 |
14 | 9ac6154d |
15 | 60749168 |
hex | 3d6f4fb1 |
1030705073 has 4 divisors (see below), whose sum is σ = 1030769700. Its totient is φ = 1030640448.
The previous prime is 1030705069. The next prime is 1030705111. The reversal of 1030705073 is 3705070301.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It can be written as a sum of positive squares in 2 ways, for example, as 795634849 + 235070224 = 28207^2 + 15332^2 .
It is a cyclic number.
It is not a de Polignac number, because 1030705073 - 22 = 1030705069 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1030705573) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10661 + ... + 46637.
It is an arithmetic number, because the mean of its divisors is an integer number (257692425).
Almost surely, 21030705073 is an apocalyptic number.
It is an amenable number.
1030705073 is a deficient number, since it is larger than the sum of its proper divisors (64627).
1030705073 is an equidigital number, since it uses as much as digits as its factorization.
1030705073 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 64626.
The product of its (nonzero) digits is 2205, while the sum is 26.
The square root of 1030705073 is about 32104.5958236512. The cubic root of 1030705073 is about 1010.1320197978.
Adding to 1030705073 its reverse (3705070301), we get a palindrome (4735775374).
The spelling of 1030705073 in words is "one billion, thirty million, seven hundred five thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •