Base | Representation |
---|---|
bin | 100000001011001111111… |
… | …100110010111010000101 |
3 | 21211101020111112010111120 |
4 | 200023033330302322011 |
5 | 242211314103323023 |
6 | 4411433301424153 |
7 | 315514111664100 |
oct | 40131774627205 |
9 | 7741214463446 |
10 | 2211102011013 |
11 | 7827a54951a5 |
12 | 2b863970b059 |
13 | 130676976b1c |
14 | 790371d7737 |
15 | 3c7b0e418e3 |
hex | 202cff32e85 |
2211102011013 has 96 divisors (see below), whose sum is σ = 3568591503360. Its totient is φ = 1212926037120.
The previous prime is 2211102010993. The next prime is 2211102011023. The reversal of 2211102011013 is 3101102011122.
2211102011013 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 2211102011013 - 28 = 2211102010757 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2211102010983 and 2211102011001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2211102011023) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 295321756 + ... + 295329242.
It is an arithmetic number, because the mean of its divisors is an integer number (37172828160).
Almost surely, 22211102011013 is an apocalyptic number.
It is an amenable number.
2211102011013 is a deficient number, since it is larger than the sum of its proper divisors (1357489492347).
2211102011013 is a wasteful number, since it uses less digits than its factorization.
2211102011013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8047 (or 8040 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 15.
Adding to 2211102011013 its reverse (3101102011122), we get a palindrome (5312204022135).
The spelling of 2211102011013 in words is "two trillion, two hundred eleven billion, one hundred two million, eleven thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •