Base | Representation |
---|---|
bin | 11111010000000011010… |
… | …11111001110001111101 |
3 | 10210122120212220022010012 |
4 | 33220001223321301331 |
5 | 120043040122010302 |
6 | 2141141055553005 |
7 | 140402011225160 |
oct | 17500153716175 |
9 | 3718525808105 |
10 | 1073770110077 |
11 | 384424263515 |
12 | 15412b52b765 |
13 | 7a343813752 |
14 | 39d83a4dad7 |
15 | 1cde7d3ba52 |
hex | fa01af9c7d |
1073770110077 has 4 divisors (see below), whose sum is σ = 1227165840096. Its totient is φ = 920374380060.
The previous prime is 1073770110071. The next prime is 1073770110107. The reversal of 1073770110077 is 7700110773701.
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 1073770110077 - 26 = 1073770110013 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1073770110071) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 76697864999 + ... + 76697865012.
It is an arithmetic number, because the mean of its divisors is an integer number (306791460024).
Almost surely, 21073770110077 is an apocalyptic number.
It is an amenable number.
1073770110077 is a deficient number, since it is larger than the sum of its proper divisors (153395730019).
1073770110077 is an equidigital number, since it uses as much as digits as its factorization.
1073770110077 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 153395730018.
The product of its (nonzero) digits is 50421, while the sum is 41.
Adding to 1073770110077 its reverse (7700110773701), we get a palindrome (8773880883778).
The spelling of 1073770110077 in words is "one trillion, seventy-three billion, seven hundred seventy million, one hundred ten thousand, seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •