Base | Representation |
---|---|
bin | 111101110100101111… |
… | …0010001110110100010 |
3 | 110200200200202000200002 |
4 | 1323221132101312202 |
5 | 4133401102011100 |
6 | 140554125100002 |
7 | 12410031533135 |
oct | 1735136216642 |
9 | 420620660602 |
10 | 132766047650 |
11 | 5133aa77725 |
12 | 218930b7602 |
13 | c69ac74b12 |
14 | 65d69b221c |
15 | 36c0ae32d5 |
hex | 1ee9791da2 |
132766047650 has 48 divisors (see below), whose sum is σ = 249068058624. Its totient is φ = 52650420480.
The previous prime is 132766047641. The next prime is 132766047691. The reversal of 132766047650 is 56740667231.
It is a junction number, because it is equal to n+sod(n) for n = 132766047595 and 132766047604.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 9854819 + ... + 9868281.
It is an arithmetic number, because the mean of its divisors is an integer number (5188917888).
Almost surely, 2132766047650 is an apocalyptic number.
132766047650 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
132766047650 is a deficient number, since it is larger than the sum of its proper divisors (116302010974).
132766047650 is a wasteful number, since it uses less digits than its factorization.
132766047650 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15155 (or 15150 counting only the distinct ones).
The product of its (nonzero) digits is 1270080, while the sum is 47.
The spelling of 132766047650 in words is "one hundred thirty-two billion, seven hundred sixty-six million, forty-seven thousand, six hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •