Base | Representation |
---|---|
bin | 111101100011110111… |
… | …1110000110011000001 |
3 | 110122020021000021011121 |
4 | 1323013233300303001 |
5 | 4131221223034010 |
6 | 140422033112241 |
7 | 12360021130444 |
oct | 1730757606301 |
9 | 418207007147 |
10 | 132200205505 |
11 | 5107a62a095 |
12 | 217556b8681 |
13 | c60a978894 |
14 | 658179b65b |
15 | 368b0c13da |
hex | 1ec7bf0cc1 |
132200205505 has 4 divisors (see below), whose sum is σ = 158640246612. Its totient is φ = 105760164400.
The previous prime is 132200205497. The next prime is 132200205539. The reversal of 132200205505 is 505502002231.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 54942891201 + 77257314304 = 234399^2 + 277952^2 .
It is not a de Polignac number, because 132200205505 - 23 = 132200205497 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 132200205505.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 13220020546 + ... + 13220020555.
It is an arithmetic number, because the mean of its divisors is an integer number (39660061653).
Almost surely, 2132200205505 is an apocalyptic number.
It is an amenable number.
132200205505 is a deficient number, since it is larger than the sum of its proper divisors (26440041107).
132200205505 is an equidigital number, since it uses as much as digits as its factorization.
132200205505 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26440041106.
The product of its (nonzero) digits is 3000, while the sum is 25.
Adding to 132200205505 its reverse (505502002231), we get a palindrome (637702207736).
The spelling of 132200205505 in words is "one hundred thirty-two billion, two hundred million, two hundred five thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •