Base | Representation |
---|---|
bin | 1001110010111101010000… |
… | …0101000010010100010101 |
3 | 1102010200221101002111122001 |
4 | 2130233110011002110111 |
5 | 2402433043010213302 |
6 | 34524051543435301 |
7 | 2161116303513505 |
oct | 234572405022425 |
9 | 42120841074561 |
10 | 10771041101077 |
11 | 3482a779a03a4 |
12 | 125b5bba55b31 |
13 | 60192163aa3a |
14 | 29346d415a05 |
15 | 13a2a5c0a787 |
hex | 9cbd4142515 |
10771041101077 has 8 divisors (see below), whose sum is σ = 10831641986880. Its totient is φ = 10710610204800.
The previous prime is 10771041101057. The next prime is 10771041101081. The reversal of 10771041101077 is 77010114017701.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10771041101077 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10771041101027) 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 7 ways as a sum of consecutive naturals, for example, 42370299 + ... + 42623752.
It is an arithmetic number, because the mean of its divisors is an integer number (1353955248360).
Almost surely, 210771041101077 is an apocalyptic number.
It is an amenable number.
10771041101077 is a deficient number, since it is larger than the sum of its proper divisors (60600885803).
10771041101077 is an equidigital number, since it uses as much as digits as its factorization.
10771041101077 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 84994763.
The product of its (nonzero) digits is 9604, while the sum is 37.
Adding to 10771041101077 its reverse (77010114017701), we get a palindrome (87781155118778).
The spelling of 10771041101077 in words is "ten trillion, seven hundred seventy-one billion, forty-one million, one hundred one thousand, seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •