Base | Representation |
---|---|
bin | 111101110011001110… |
… | …0011000011010101001 |
3 | 110200120011002122022201 |
4 | 1323212130120122221 |
5 | 4133300043443401 |
6 | 140545111420201 |
7 | 12405543513400 |
oct | 1734634303251 |
9 | 420504078281 |
10 | 132715218601 |
11 | 51314310049 |
12 | 2187a084661 |
13 | c690589264 |
14 | 65cdd40637 |
15 | 36bb402b01 |
hex | 1ee67186a9 |
132715218601 has 27 divisors (see below), whose sum is σ = 156801961143. Its totient is φ = 112000699440.
The previous prime is 132715218577. The next prime is 132715218659. The reversal of 132715218601 is 106812517231.
The square root of 132715218601 is 364301.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 129834105625 + 2881112976 = 360325^2 + 53676^2 .
It is not a de Polignac number, because 132715218601 - 25 = 132715218569 is a prime.
It is a super-2 number, since 2×1327152186012 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (132715210601) by changing a digit.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 181057231 + ... + 181057963.
Almost surely, 2132715218601 is an apocalyptic number.
132715218601 is the 364301-st square number.
132715218601 is the 182151-st centered octagonal number.
It is an amenable number.
132715218601 is a deficient number, since it is larger than the sum of its proper divisors (24086742542).
132715218601 is an frugal number, since it uses more digits than its factorization.
132715218601 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1622 (or 811 counting only the distinct ones).
The product of its (nonzero) digits is 20160, while the sum is 37.
The spelling of 132715218601 in words is "one hundred thirty-two billion, seven hundred fifteen million, two hundred eighteen thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •