Base | Representation |
---|---|
bin | 111111111101011… |
… | …001010100110001 |
3 | 2202210011001101102 |
4 | 333331121110301 |
5 | 4144200342441 |
6 | 254251214145 |
7 | 35406565151 |
oct | 7775312461 |
9 | 2683131342 |
10 | 1073059121 |
11 | 500794222 |
12 | 25b447355 |
13 | 14140a234 |
14 | a2728761 |
15 | 6431369b |
hex | 3ff59531 |
1073059121 has 4 divisors (see below), whose sum is σ = 1081250544. Its totient is φ = 1064867700.
The previous prime is 1073059103. The next prime is 1073059123. The reversal of 1073059121 is 1219503701.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1073059121 - 210 = 1073058097 is a prime.
It is a super-2 number, since 2×10730591212 = 2302911754322585282, which contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (1073059123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4095515 + ... + 4095776.
It is an arithmetic number, because the mean of its divisors is an integer number (270312636).
Almost surely, 21073059121 is an apocalyptic number.
It is an amenable number.
1073059121 is a deficient number, since it is larger than the sum of its proper divisors (8191423).
1073059121 is an equidigital number, since it uses as much as digits as its factorization.
1073059121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8191422.
The product of its (nonzero) digits is 1890, while the sum is 29.
The square root of 1073059121 is about 32757.5811225432. The cubic root of 1073059121 is about 1023.7829285487.
The spelling of 1073059121 in words is "one billion, seventy-three million, fifty-nine thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •