Base | Representation |
---|---|
bin | 1011111010100001010100… |
… | …0110001101001000111101 |
3 | 1201101100101211001022020120 |
4 | 2332220111012031020331 |
5 | 3204112302033413041 |
6 | 43510020413405153 |
7 | 2521305213314643 |
oct | 276502506151075 |
9 | 51340354038216 |
10 | 13100004201021 |
11 | 41a0753945111 |
12 | 1576a50a997b9 |
13 | 74042c30906a |
14 | 33408785b193 |
15 | 17ab63e51366 |
hex | bea1518d23d |
13100004201021 has 32 divisors (see below), whose sum is σ = 18660009875328. Its totient is φ = 8145900564480.
The previous prime is 13100004201013. The next prime is 13100004201041. The reversal of 13100004201021 is 12010240000131.
13100004201021 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 13100004201021 - 23 = 13100004201013 is a prime.
It is a super-2 number, since 2×131000042010212 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13100004201041) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 49874566 + ... + 50136536.
It is an arithmetic number, because the mean of its divisors is an integer number (583125308604).
Almost surely, 213100004201021 is an apocalyptic number.
It is an amenable number.
13100004201021 is a deficient number, since it is larger than the sum of its proper divisors (5560005674307).
13100004201021 is a wasteful number, since it uses less digits than its factorization.
13100004201021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 270781.
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 13100004201021 its reverse (12010240000131), we get a palindrome (25110244201152).
The spelling of 13100004201021 in words is "thirteen trillion, one hundred billion, four million, two hundred one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •