Base | Representation |
---|---|
bin | 1011110101011101101100… |
… | …1000001101101011111101 |
3 | 1201002001011120020122110211 |
4 | 2331113123020031223331 |
5 | 3201201343332144401 |
6 | 43402052255232421 |
7 | 2512111356341350 |
oct | 275273310155375 |
9 | 51061146218424 |
10 | 13013132303101 |
11 | 4167924a2a457 |
12 | 1562047818711 |
13 | 7351965a0c78 |
14 | 32dba6190297 |
15 | 17877c51e951 |
hex | bd5db20dafd |
13013132303101 has 8 divisors (see below), whose sum is σ = 14958117396864. Its totient is φ = 11089638757680.
The previous prime is 13013132303047. The next prime is 13013132303111. The reversal of 13013132303101 is 10130323131031.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-13013132303101 is a prime.
It is a super-2 number, since 2×130131323031012 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13013132303111) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5372885785 + ... + 5372888206.
It is an arithmetic number, because the mean of its divisors is an integer number (1869764674608).
Almost surely, 213013132303101 is an apocalyptic number.
It is an amenable number.
13013132303101 is a deficient number, since it is larger than the sum of its proper divisors (1944985093763).
13013132303101 is a wasteful number, since it uses less digits than its factorization.
13013132303101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10745774171.
The product of its (nonzero) digits is 486, while the sum is 22.
Adding to 13013132303101 its reverse (10130323131031), we get a palindrome (23143455434132).
The spelling of 13013132303101 in words is "thirteen trillion, thirteen billion, one hundred thirty-two million, three hundred three thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •