Base | Representation |
---|---|
bin | 111101101101000000… |
… | …0110000101110101011 |
3 | 110200000121122100010121 |
4 | 1323122000300232223 |
5 | 4132333200322223 |
6 | 140512301224111 |
7 | 12400431645256 |
oct | 1733200605653 |
9 | 420017570117 |
10 | 132506651563 |
11 | 512176065a0 |
12 | 21820262037 |
13 | c6592c2700 |
14 | 65b036c09d |
15 | 36a7e5515d |
hex | 1eda030bab |
132506651563 has 12 divisors (see below), whose sum is σ = 156527493768. Its totient is φ = 111194391360.
The previous prime is 132506651507. The next prime is 132506651579. The reversal of 132506651563 is 365156605231.
It is a de Polignac number, because none of the positive numbers 2k-132506651563 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (132506651063) by changing a digit.
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 11 ways as a sum of consecutive naturals, for example, 35637370 + ... + 35641087.
It is an arithmetic number, because the mean of its divisors is an integer number (13043957814).
Almost surely, 2132506651563 is an apocalyptic number.
132506651563 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
132506651563 is a deficient number, since it is larger than the sum of its proper divisors (24020842205).
132506651563 is a wasteful number, since it uses less digits than its factorization.
132506651563 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 71278494 (or 71278481 counting only the distinct ones).
The product of its (nonzero) digits is 486000, while the sum is 43.
The spelling of 132506651563 in words is "one hundred thirty-two billion, five hundred six million, six hundred fifty-one thousand, five hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •