Base | Representation |
---|---|
bin | 1011111011101011110011… |
… | …1100111101101111000101 |
3 | 1201110021000101002022200211 |
4 | 2332322330330331233011 |
5 | 3204424230024020401 |
6 | 43523124521435421 |
7 | 2522613556551445 |
oct | 276727474755705 |
9 | 51407011068624 |
10 | 13120000220101 |
11 | 41a91850a5215 |
12 | 157a8b163bb71 |
13 | 742297c1ba08 |
14 | 3350233c8125 |
15 | 17b434682951 |
hex | beebcf3dbc5 |
13120000220101 has 4 divisors (see below), whose sum is σ = 13122584428492. Its totient is φ = 13117416011712.
The previous prime is 13120000220099. The next prime is 13120000220113. The reversal of 13120000220101 is 10102200002131.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 6724032769476 + 6395967450625 = 2593074^2 + 2529025^2 .
It is a cyclic number.
It is not a de Polignac number, because 13120000220101 - 21 = 13120000220099 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 (13120000220141) 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, 1292096580 + ... + 1292106733.
It is an arithmetic number, because the mean of its divisors is an integer number (3280646107123).
Almost surely, 213120000220101 is an apocalyptic number.
It is an amenable number.
13120000220101 is a deficient number, since it is larger than the sum of its proper divisors (2584208391).
13120000220101 is an equidigital number, since it uses as much as digits as its factorization.
13120000220101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2584208390.
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 13120000220101 its reverse (10102200002131), we get a palindrome (23222200222232).
The spelling of 13120000220101 in words is "thirteen trillion, one hundred twenty billion, two hundred twenty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •