Base | Representation |
---|---|
bin | 111101101100111101… |
… | …1010010000010000110 |
3 | 110200000111221100200122 |
4 | 1323121323102002012 |
5 | 4132332313340420 |
6 | 140512210341542 |
7 | 12400413513332 |
oct | 1733173220206 |
9 | 420014840618 |
10 | 132505215110 |
11 | 51216815344 |
12 | 2181b88a8b2 |
13 | c658c0b938 |
14 | 65b00b67c2 |
15 | 36a7c6e725 |
hex | 1ed9ed2086 |
132505215110 has 32 divisors (see below), whose sum is σ = 257847999840. Its totient is φ = 48855405312.
The previous prime is 132505215103. The next prime is 132505215163. The reversal of 132505215110 is 11512505231.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 132505215110.
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 15 ways as a sum of consecutive naturals, for example, 9417239 + ... + 9431298.
It is an arithmetic number, because the mean of its divisors is an integer number (8057749995).
Almost surely, 2132505215110 is an apocalyptic number.
132505215110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
132505215110 is a deficient number, since it is larger than the sum of its proper divisors (125342784730).
132505215110 is a wasteful number, since it uses less digits than its factorization.
132505215110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18848600.
The product of its (nonzero) digits is 1500, while the sum is 26.
The spelling of 132505215110 in words is "one hundred thirty-two billion, five hundred five million, two hundred fifteen thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •