Base | Representation |
---|---|
bin | 101101101101110100111100… |
… | …010011010100100110000101 |
3 | 222100220021101210102002011012 |
4 | 231231310330103110212011 |
5 | 202323142033311210301 |
6 | 1551342143204452005 |
7 | 60231125560166324 |
oct | 5555647423244605 |
9 | 870807353362135 |
10 | 201061315725701 |
11 | 59078697084512 |
12 | 1a6730439aa005 |
13 | 8826001767602 |
14 | 37915c35760bb |
15 | 183a0ed802ebb |
hex | b6dd3c4d4985 |
201061315725701 has 8 divisors (see below), whose sum is σ = 211649829244800. Its totient is φ = 190473436107360.
The previous prime is 201061315725679. The next prime is 201061315725713. The reversal of 201061315725701 is 107527513160102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 201061315725701 - 210 = 201061315724677 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 (201061315725761) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 157824056 + ... + 159092913.
It is an arithmetic number, because the mean of its divisors is an integer number (26456228655600).
Almost surely, 2201061315725701 is an apocalyptic number.
It is an amenable number.
201061315725701 is a deficient number, since it is larger than the sum of its proper divisors (10588513519099).
201061315725701 is a wasteful number, since it uses less digits than its factorization.
201061315725701 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 316950379.
The product of its (nonzero) digits is 88200, while the sum is 41.
Adding to 201061315725701 its reverse (107527513160102), we get a palindrome (308588828885803).
The spelling of 201061315725701 in words is "two hundred one trillion, sixty-one billion, three hundred fifteen million, seven hundred twenty-five thousand, seven hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •