Base | Representation |
---|---|
bin | 101101101110000000100010… |
… | …110100010110000010110101 |
3 | 222100221110112222010002002002 |
4 | 231232000202310112002311 |
5 | 202323343041401423121 |
6 | 1551352003253025045 |
7 | 60232046354006642 |
oct | 5556004264260265 |
9 | 870843488102062 |
10 | 201073773076661 |
11 | 590829a9a12691 |
12 | 1a67553b925185 |
13 | 88272385a09b4 |
14 | 3792045c06dc9 |
15 | 183a5cc2b4e0b |
hex | b6e022d160b5 |
201073773076661 has 2 divisors, whose sum is σ = 201073773076662. Its totient is φ = 201073773076660.
The previous prime is 201073773076591. The next prime is 201073773076691. The reversal of 201073773076661 is 166670377370102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 184687420500625 + 16386352576036 = 13589975^2 + 4048006^2 .
It is a cyclic number.
It is not a de Polignac number, because 201073773076661 - 242 = 196675726565557 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 201073773076597 and 201073773076606.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (201073773076691) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100536886538330 + 100536886538331.
It is an arithmetic number, because the mean of its divisors is an integer number (100536886538331).
Almost surely, 2201073773076661 is an apocalyptic number.
It is an amenable number.
201073773076661 is a deficient number, since it is larger than the sum of its proper divisors (1).
201073773076661 is an equidigital number, since it uses as much as digits as its factorization.
201073773076661 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9335088, while the sum is 56.
The spelling of 201073773076661 in words is "two hundred one trillion, seventy-three billion, seven hundred seventy-three million, seventy-six thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •