Base | Representation |
---|---|
bin | 111101101010011111… |
… | …1101011100100011001 |
3 | 110122210202021002110211 |
4 | 1323110333223210121 |
5 | 4132200123412301 |
6 | 140500053211121 |
7 | 12365360345452 |
oct | 1732477534431 |
9 | 418722232424 |
10 | 132422482201 |
11 | 51184047939 |
12 | 217b8030aa1 |
13 | c644a32659 |
14 | 65a30dc129 |
15 | 36a087b051 |
hex | 1ed4feb919 |
132422482201 has 9 divisors (see below), whose sum is σ = 133758479199. Its totient is φ = 131099709336.
The previous prime is 132422482189. The next prime is 132422482207. The reversal of 132422482201 is 102284224231.
The square root of 132422482201 is 363899.
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., 108296937225 + 24125544976 = 329085^2 + 155324^2 .
It is not a de Polignac number, because 132422482201 - 29 = 132422481689 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (132422482207) by changing a digit.
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 8 ways as a sum of consecutive naturals, for example, 37479831 + ... + 37483363.
Almost surely, 2132422482201 is an apocalyptic number.
132422482201 is the 363899-th square number.
132422482201 is the 181950-th centered octagonal number.
It is an amenable number.
132422482201 is a deficient number, since it is larger than the sum of its proper divisors (1335996998).
132422482201 is an frugal number, since it uses more digits than its factorization.
132422482201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7272 (or 3636 counting only the distinct ones).
The product of its (nonzero) digits is 12288, while the sum is 31.
The spelling of 132422482201 in words is "one hundred thirty-two billion, four hundred twenty-two million, four hundred eighty-two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •