Base | Representation |
---|---|
bin | 1011111100011000100001… |
… | …0010110110000001011000 |
3 | 1201111101222202220220020012 |
4 | 2333012020102312001120 |
5 | 3210123314411240422 |
6 | 43532431442221052 |
7 | 2523520146264161 |
oct | 277061022660130 |
9 | 51441882826205 |
10 | 13132001665112 |
11 | 4203283653510 |
12 | 15810a0954788 |
13 | 74345b46b175 |
14 | 3358412a0768 |
15 | 17b8d80db4e2 |
hex | bf1884b6058 |
13132001665112 has 32 divisors (see below), whose sum is σ = 26916989644800. Its totient is φ = 5956630077600.
The previous prime is 13132001665103. The next prime is 13132001665121. The reversal of 13132001665112 is 21156610023131.
It is an interprime number because it is at equal distance from previous prime (13132001665103) and next prime (13132001665121).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 155727464 + ... + 155811767.
It is an arithmetic number, because the mean of its divisors is an integer number (841155926400).
Almost surely, 213132001665112 is an apocalyptic number.
It is an amenable number.
13132001665112 is an abundant number, since it is smaller than the sum of its proper divisors (13784987979688).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13132001665112 is a wasteful number, since it uses less digits than its factorization.
13132001665112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 311539727 (or 311539723 counting only the distinct ones).
The product of its (nonzero) digits is 6480, while the sum is 32.
Adding to 13132001665112 its reverse (21156610023131), we get a palindrome (34288611688243).
The spelling of 13132001665112 in words is "thirteen trillion, one hundred thirty-two billion, one million, six hundred sixty-five thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •