Base | Representation |
---|---|
bin | 111101110110001000… |
… | …1010100000100111000 |
3 | 110200210222001110111010 |
4 | 1323230101110010320 |
5 | 4134000110334121 |
6 | 141002523033520 |
7 | 12411141464535 |
oct | 1735421240470 |
9 | 420728043433 |
10 | 132812980536 |
11 | 51364513035 |
12 | 218a696b8a0 |
13 | c6a78c8162 |
14 | 65dcd0bd8c |
15 | 36c4cb4376 |
hex | 1eec454138 |
132812980536 has 128 divisors (see below), whose sum is σ = 343080541440. Its totient is φ = 42826828800.
The previous prime is 132812980523. The next prime is 132812980537. The reversal of 132812980536 is 635089218231.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132812980537) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 28309951 + ... + 28314641.
It is an arithmetic number, because the mean of its divisors is an integer number (2680316730).
Almost surely, 2132812980536 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 132812980536, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (171540270720).
132812980536 is an abundant number, since it is smaller than the sum of its proper divisors (210267560904).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132812980536 is a wasteful number, since it uses less digits than its factorization.
132812980536 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5077 (or 5073 counting only the distinct ones).
The product of its (nonzero) digits is 622080, while the sum is 48.
The spelling of 132812980536 in words is "one hundred thirty-two billion, eight hundred twelve million, nine hundred eighty thousand, five hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •