Base | Representation |
---|---|
bin | 100000000001110111000… |
… | …101100011011010001101 |
3 | 21210102012221200212112012 |
4 | 200001313011203122031 |
5 | 242030142411400023 |
6 | 4403045110551005 |
7 | 315006233340416 |
oct | 40016705433215 |
9 | 7712187625465 |
10 | 2201021200013 |
11 | 7794a20a5739 |
12 | 2b66a5668465 |
13 | 12c72b3040bc |
14 | 7875c43a80d |
15 | 3c3c0e1e978 |
hex | 2007716368d |
2201021200013 has 4 divisors (see below), whose sum is σ = 2227539527808. Its totient is φ = 2174502872220.
The previous prime is 2201021200003. The next prime is 2201021200033. The reversal of 2201021200013 is 3100021201022.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 2201021200013 - 28 = 2201021199757 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2201021200003) 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, 13259163773 + ... + 13259163938.
It is an arithmetic number, because the mean of its divisors is an integer number (556884881952).
Almost surely, 22201021200013 is an apocalyptic number.
It is an amenable number.
2201021200013 is a deficient number, since it is larger than the sum of its proper divisors (26518327795).
2201021200013 is an equidigital number, since it uses as much as digits as its factorization.
2201021200013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 26518327794.
The product of its (nonzero) digits is 48, while the sum is 14.
Adding to 2201021200013 its reverse (3100021201022), we get a palindrome (5301042401035).
The spelling of 2201021200013 in words is "two trillion, two hundred one billion, twenty-one million, two hundred thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •