Base | Representation |
---|---|
bin | 1011111100011000111111… |
… | …1100100001110111011001 |
3 | 1201111102022201110200000121 |
4 | 2333012033330201313121 |
5 | 3210124100242024423 |
6 | 43532452305433241 |
7 | 2523523265350000 |
oct | 277061774416731 |
9 | 51442281420017 |
10 | 13132130033113 |
11 | 420333a060273 |
12 | 158111793b821 |
13 | 74347bc34b70 |
14 | 335854357c37 |
15 | 17b8e44e645d |
hex | bf18ff21dd9 |
13132130033113 has 20 divisors (see below), whose sum is σ = 16498361206628. Its totient is φ = 10390256704800.
The previous prime is 13132130033089. The next prime is 13132130033179. The reversal of 13132130033113 is 31133003123131.
It can be written as a sum of positive squares in 2 ways, for example, as 1445085281689 + 11687044751424 = 1202117^2 + 3418632^2 .
It is not a de Polignac number, because 13132130033113 - 25 = 13132130033081 is a prime.
It is not an unprimeable number, because it can be changed into a prime (13132130033413) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 210331938 + ... + 210394363.
Almost surely, 213132130033113 is an apocalyptic number.
13132130033113 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
13132130033113 is a deficient number, since it is larger than the sum of its proper divisors (3366231173515).
13132130033113 is an frugal number, since it uses more digits than its factorization.
13132130033113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 420726342 (or 420726321 counting only the distinct ones).
The product of its (nonzero) digits is 1458, while the sum is 25.
Adding to 13132130033113 its reverse (31133003123131), we get a palindrome (44265133156244).
The spelling of 13132130033113 in words is "thirteen trillion, one hundred thirty-two billion, one hundred thirty million, thirty-three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.260 sec. • engine limits •