Base | Representation |
---|---|
bin | 1011111100011001010101… |
… | …1000000000101000111101 |
3 | 1201111102120001212112001001 |
4 | 2333012111120000220331 |
5 | 3210124242101420013 |
6 | 43532505322050301 |
7 | 2523525452532400 |
oct | 277062530005075 |
9 | 51442501775031 |
10 | 13132221123133 |
11 | 4203386516582 |
12 | 1581142349991 |
13 | 743494a78c98 |
14 | 3358624a9d37 |
15 | 17b8ec4daddd |
hex | bf195600a3d |
13132221123133 has 12 divisors (see below), whose sum is σ = 15291219337212. Its totient is φ = 11245164819840.
The previous prime is 13132221123121. The next prime is 13132221123167. The reversal of 13132221123133 is 33132112223131.
It can be written as a sum of positive squares in 2 ways, for example, as 2832499098009 + 10299722025124 = 1683003^2 + 3209318^2 .
It is a de Polignac number, because none of the positive numbers 2k-13132221123133 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13132221123233) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 131196060 + ... + 131296117.
It is an arithmetic number, because the mean of its divisors is an integer number (1274268278101).
Almost surely, 213132221123133 is an apocalyptic number.
It is an amenable number.
13132221123133 is a deficient number, since it is larger than the sum of its proper divisors (2158998214079).
13132221123133 is a wasteful number, since it uses less digits than its factorization.
13132221123133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 262493212 (or 262493205 counting only the distinct ones).
The product of its digits is 3888, while the sum is 28.
Adding to 13132221123133 its reverse (33132112223131), we get a palindrome (46264333346264).
The spelling of 13132221123133 in words is "thirteen trillion, one hundred thirty-two billion, two hundred twenty-one million, one hundred twenty-three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •