Base | Representation |
---|---|
bin | 11110001000110010101001… |
… | …010111000001111111000001 |
3 | 122101022020012000211021221201 |
4 | 132020302221113001333001 |
5 | 114333111222212012010 |
6 | 1145522324334021201 |
7 | 36630045563666350 |
oct | 3610625127017701 |
9 | 571266160737851 |
10 | 132545532141505 |
11 | 3926227649131a |
12 | 12a48266647801 |
13 | 58c5cb41a5192 |
14 | 24a3349061997 |
15 | 104cc306ae23a |
hex | 788ca95c1fc1 |
132545532141505 has 32 divisors (see below), whose sum is σ = 184130143395840. Its totient is φ = 89712313629120.
The previous prime is 132545532141499. The next prime is 132545532141511. The reversal of 132545532141505 is 505141235545231.
It is an interprime number because it is at equal distance from previous prime (132545532141499) and next prime (132545532141511).
It is not a de Polignac number, because 132545532141505 - 23 = 132545532141497 is a prime.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2881242 + ... + 16534588.
It is an arithmetic number, because the mean of its divisors is an integer number (5754066981120).
Almost surely, 2132545532141505 is an apocalyptic number.
It is an amenable number.
132545532141505 is a deficient number, since it is larger than the sum of its proper divisors (51584611254335).
132545532141505 is a wasteful number, since it uses less digits than its factorization.
132545532141505 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13656949.
The product of its (nonzero) digits is 1800000, while the sum is 46.
Adding to 132545532141505 its reverse (505141235545231), we get a palindrome (637686767686736).
The spelling of 132545532141505 in words is "one hundred thirty-two trillion, five hundred forty-five billion, five hundred thirty-two million, one hundred forty-one thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •