Base | Representation |
---|---|
bin | 11101010010111100001… |
… | …000011101110010011101 |
3 | 21010110102102220200011021 |
4 | 131102330020131302131 |
5 | 230441013430432201 |
6 | 4140503552524141 |
7 | 265306666260616 |
oct | 35227410356235 |
9 | 7113372820137 |
10 | 2013201030301 |
11 | 70688055228a |
12 | 286208b50651 |
13 | 117ac84912c6 |
14 | 6d621bc8c0d |
15 | 3757bdddea1 |
hex | 1d4bc21dc9d |
2013201030301 has 4 divisors (see below), whose sum is σ = 2013209912572. Its totient is φ = 2013192148032.
The previous prime is 2013201030287. The next prime is 2013201030311. The reversal of 2013201030301 is 1030301023102.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1544181507801 + 469019522500 = 1242651^2 + 684850^2 .
It is a cyclic number.
It is not a de Polignac number, because 2013201030301 - 27 = 2013201030173 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 (2013201030311) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4092006 + ... + 4557511.
It is an arithmetic number, because the mean of its divisors is an integer number (503302478143).
Almost surely, 22013201030301 is an apocalyptic number.
It is an amenable number.
2013201030301 is a deficient number, since it is larger than the sum of its proper divisors (8882271).
2013201030301 is an equidigital number, since it uses as much as digits as its factorization.
2013201030301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8882270.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 2013201030301 its reverse (1030301023102), we get a palindrome (3043502053403).
The spelling of 2013201030301 in words is "two trillion, thirteen billion, two hundred one million, thirty thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •