Base | Representation |
---|---|
bin | 11110100100101110100… |
… | …111110100111010001101 |
3 | 21102212002210001112021111 |
4 | 132210232213310322031 |
5 | 233410342411400023 |
6 | 4245110143532021 |
7 | 304536156352051 |
oct | 36445647647215 |
9 | 7385083045244 |
10 | 2101021200013 |
11 | 74004676a63a |
12 | 29b2378ba011 |
13 | 1231827c4678 |
14 | 739933b9c61 |
15 | 399bbbd500d |
hex | 1e92e9f4e8d |
2101021200013 has 16 divisors (see below), whose sum is σ = 2183988280320. Its totient is φ = 2018761766784.
The previous prime is 2101021200011. The next prime is 2101021200023. The reversal of 2101021200013 is 3100021201012.
It is a cyclic number.
It is not a de Polignac number, because 2101021200013 - 21 = 2101021200011 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2101021199966 and 2101021200002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2101021200011) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 18717745 + ... + 18829657.
It is an arithmetic number, because the mean of its divisors is an integer number (136499267520).
Almost surely, 22101021200013 is an apocalyptic number.
It is an amenable number.
2101021200013 is a deficient number, since it is larger than the sum of its proper divisors (82967080307).
2101021200013 is a wasteful number, since it uses less digits than its factorization.
2101021200013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 115068.
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 2101021200013 its reverse (3100021201012), we get a palindrome (5201042401025).
Subtracting 2101021200013 from its reverse (3100021201012), we obtain a palindrome (999000000999).
The spelling of 2101021200013 in words is "two trillion, one hundred one billion, twenty-one million, two hundred thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •