Base | Representation |
---|---|
bin | 1011111011101011110100… |
… | …0011110010101111110101 |
3 | 1201110021000111110021010010 |
4 | 2332322331003302233311 |
5 | 3204424231003310401 |
6 | 43523125024050433 |
7 | 2522613611015220 |
oct | 276727503625765 |
9 | 51407014407103 |
10 | 13120002010101 |
11 | 41a9186108058 |
12 | 157a8b2163a19 |
13 | 7422983c769c |
14 | 3350237325b7 |
15 | 17b4348d7ed6 |
hex | beebd0f2bf5 |
13120002010101 has 64 divisors (see below), whose sum is σ = 20270790199296. Its totient is φ = 7393362912000.
The previous prime is 13120002010081. The next prime is 13120002010117. The reversal of 13120002010101 is 10101020002131.
It is not a de Polignac number, because 13120002010101 - 210 = 13120002009077 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13120002010121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 1324311390 + ... + 1324321296.
It is an arithmetic number, because the mean of its divisors is an integer number (316731096864).
Almost surely, 213120002010101 is an apocalyptic number.
It is an amenable number.
13120002010101 is a deficient number, since it is larger than the sum of its proper divisors (7150788189195).
13120002010101 is a wasteful number, since it uses less digits than its factorization.
13120002010101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12442.
The product of its (nonzero) digits is 12, while the sum is 12.
Adding to 13120002010101 its reverse (10101020002131), we get a palindrome (23221022012232).
The spelling of 13120002010101 in words is "thirteen trillion, one hundred twenty billion, two million, ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •