Base | Representation |
---|---|
bin | 1011101101000001001… |
… | …0111010101101100101 |
3 | 201012222102201112222001 |
4 | 2323100102322231211 |
5 | 11243234124144441 |
6 | 232211144205301 |
7 | 20345350166314 |
oct | 2732022725545 |
9 | 635872645861 |
10 | 201063115621 |
11 | 782a7983755 |
12 | 32b73769831 |
13 | 15c63657484 |
14 | 9a3537c27b |
15 | 536b971731 |
hex | 2ed04bab65 |
201063115621 has 2 divisors, whose sum is σ = 201063115622. Its totient is φ = 201063115620.
The previous prime is 201063115601. The next prime is 201063115637. The reversal of 201063115621 is 126511360102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 175921524900 + 25141590721 = 419430^2 + 158561^2 .
It is a cyclic number.
It is not a de Polignac number, because 201063115621 - 215 = 201063082853 is a prime.
It is a super-2 number, since 2×2010631156212 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 201063115621.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (201063115601) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100531557810 + 100531557811.
It is an arithmetic number, because the mean of its divisors is an integer number (100531557811).
Almost surely, 2201063115621 is an apocalyptic number.
It is an amenable number.
201063115621 is a deficient number, since it is larger than the sum of its proper divisors (1).
201063115621 is an equidigital number, since it uses as much as digits as its factorization.
201063115621 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2160, while the sum is 28.
Adding to 201063115621 its reverse (126511360102), we get a palindrome (327574475723).
The spelling of 201063115621 in words is "two hundred one billion, sixty-three million, one hundred fifteen thousand, six hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •