Base | Representation |
---|---|
bin | 1011101101000000100… |
… | …0001101111010000101 |
3 | 201012222020110001021122 |
4 | 2323100020031322011 |
5 | 11243232414420121 |
6 | 232211004123325 |
7 | 20345314304510 |
oct | 2732010157205 |
9 | 635866401248 |
10 | 201060310661 |
11 | 782a6338301 |
12 | 32b72836545 |
13 | 15c62bb4832 |
14 | 9a34c4bd77 |
15 | 536b5ba5ab |
hex | 2ed020de85 |
201060310661 has 16 divisors (see below), whose sum is σ = 231204585600. Its totient is φ = 171272528448.
The previous prime is 201060310657. The next prime is 201060310673. The reversal of 201060310661 is 166013060102.
It is not a de Polignac number, because 201060310661 - 22 = 201060310657 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 201060310661.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201060315661) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2094431 + ... + 2188323.
It is an arithmetic number, because the mean of its divisors is an integer number (14450286600).
Almost surely, 2201060310661 is an apocalyptic number.
It is an amenable number.
201060310661 is a deficient number, since it is larger than the sum of its proper divisors (30144274939).
201060310661 is a wasteful number, since it uses less digits than its factorization.
201060310661 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 95788.
The product of its (nonzero) digits is 1296, while the sum is 26.
Adding to 201060310661 its reverse (166013060102), we get a palindrome (367073370763).
The spelling of 201060310661 in words is "two hundred one billion, sixty million, three hundred ten thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •