Base | Representation |
---|---|
bin | 101101111011101000011110… |
… | …010110011100111000011101 |
3 | 222111020222010022010110011110 |
4 | 231323220132112130320131 |
5 | 202434212440224031023 |
6 | 1553350040250412233 |
7 | 60356512100040051 |
oct | 5573503626347035 |
9 | 874228108113143 |
10 | 202010001002013 |
11 | 59403a621a2a56 |
12 | 1a7a6a84731079 |
13 | 88945cc7a1809 |
14 | 37c549c817c61 |
15 | 1854b25076a93 |
hex | b7ba1e59ce1d |
202010001002013 has 8 divisors (see below), whose sum is σ = 269580679013376. Its totient is φ = 134556328496000.
The previous prime is 202010001002009. The next prime is 202010001002023. The reversal of 202010001002013 is 310200100010202.
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 202010001002013 - 22 = 202010001002009 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 202010001002013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (202010001002023) 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, 29251372308 + ... + 29251379213.
It is an arithmetic number, because the mean of its divisors is an integer number (33697584876672).
Almost surely, 2202010001002013 is an apocalyptic number.
It is an amenable number.
202010001002013 is a deficient number, since it is larger than the sum of its proper divisors (67570678011363).
202010001002013 is a wasteful number, since it uses less digits than its factorization.
202010001002013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 58502752675.
The product of its (nonzero) digits is 24, while the sum is 12.
Adding to 202010001002013 its reverse (310200100010202), we get a palindrome (512210101012215).
The spelling of 202010001002013 in words is "two hundred two trillion, ten billion, one million, two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •