Base | Representation |
---|---|
bin | 101101111110011010010111… |
… | …011011110001101010011101 |
3 | 222111221020011010010211001220 |
4 | 231332122113123301222131 |
5 | 203000330132304031023 |
6 | 1554013510113523553 |
7 | 60406353356202402 |
oct | 5576322733615235 |
9 | 874836133124056 |
10 | 202201011002013 |
11 | 59477a70383091 |
12 | 1a817ab15735b9 |
13 | 88a962043225a |
14 | 37d081c9682a9 |
15 | 1859aa41473e3 |
hex | b7e6976f1a9d |
202201011002013 has 8 divisors (see below), whose sum is σ = 269999577470688. Its totient is φ = 134601559267344.
The previous prime is 202201011001939. The next prime is 202201011002021. The reversal of 202201011002013 is 310200110102202.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 202201011002013 - 218 = 202201010739869 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 202201011001983 and 202201011002001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (202201011002083) 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, 49778681131 + ... + 49778685192.
It is an arithmetic number, because the mean of its divisors is an integer number (33749947183836).
Almost surely, 2202201011002013 is an apocalyptic number.
It is an amenable number.
202201011002013 is a deficient number, since it is larger than the sum of its proper divisors (67798566468675).
202201011002013 is an equidigital number, since it uses as much as digits as its factorization.
202201011002013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 99557367003.
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 202201011002013 its reverse (310200110102202), we get a palindrome (512401121104215).
The spelling of 202201011002013 in words is "two hundred two trillion, two hundred one billion, eleven million, two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •