Base | Representation |
---|---|
bin | 100000000010001001100… |
… | …000101110011100110101 |
3 | 21210110000111100102211211 |
4 | 200002021200232130311 |
5 | 242031311030004023 |
6 | 4403135512201421 |
7 | 315020005633456 |
oct | 40021140563465 |
9 | 7713014312754 |
10 | 2201330313013 |
11 | 779640633927 |
12 | 2b6771099271 |
13 | 12c77a372ac0 |
14 | 7878b50312d |
15 | 3c3dd12da0d |
hex | 2008982e735 |
2201330313013 has 8 divisors (see below), whose sum is σ = 2370746083608. Its totient is φ = 2031926352384.
The previous prime is 2201330312999. The next prime is 2201330313019. The reversal of 2201330313013 is 3103130331022.
It can be written as a sum of positive squares in 4 ways, for example, as 515090419204 + 1686239893809 = 717698^2 + 1298553^2 .
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 2201330313013 - 229 = 2200793442101 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 (2201330313019) 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, 2563456 + ... + 3312697.
It is an arithmetic number, because the mean of its divisors is an integer number (296343260451).
Almost surely, 22201330313013 is an apocalyptic number.
It is an amenable number.
2201330313013 is a deficient number, since it is larger than the sum of its proper divisors (169415770595).
2201330313013 is a wasteful number, since it uses less digits than its factorization.
2201330313013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5904983.
The product of its (nonzero) digits is 972, while the sum is 22.
Adding to 2201330313013 its reverse (3103130331022), we get a palindrome (5304460644035).
The spelling of 2201330313013 in words is "two trillion, two hundred one billion, three hundred thirty million, three hundred thirteen thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •