Base | Representation |
---|---|
bin | 11101011111010000011… |
… | …01010010001100100101 |
3 | 10120212021120020000101101 |
4 | 32233220031102030211 |
5 | 113100030024023302 |
6 | 2053244053200101 |
7 | 133126236225526 |
oct | 16575015221445 |
9 | 3525246200341 |
10 | 1013213111077 |
11 | 360779428902 |
12 | 14444b030031 |
13 | 7471286546b |
14 | 3707b20884d |
15 | 1b551762287 |
hex | ebe8352325 |
1013213111077 has 2 divisors, whose sum is σ = 1013213111078. Its totient is φ = 1013213111076.
The previous prime is 1013213111047. The next prime is 1013213111137. The reversal of 1013213111077 is 7701113123101.
1013213111077 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 549541998721 + 463671112356 = 741311^2 + 680934^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1013213111077 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1013213111047) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 506606555538 + 506606555539.
It is an arithmetic number, because the mean of its divisors is an integer number (506606555539).
Almost surely, 21013213111077 is an apocalyptic number.
It is an amenable number.
1013213111077 is a deficient number, since it is larger than the sum of its proper divisors (1).
1013213111077 is an equidigital number, since it uses as much as digits as its factorization.
1013213111077 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 882, while the sum is 28.
Adding to 1013213111077 its reverse (7701113123101), we get a palindrome (8714326234178).
The spelling of 1013213111077 in words is "one trillion, thirteen billion, two hundred thirteen million, one hundred eleven thousand, seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •