Base | Representation |
---|---|
bin | 111101001001111011… |
… | …0110101110001010010 |
3 | 110112222120220020120000 |
4 | 1322103312311301102 |
5 | 4122430342130100 |
6 | 140155414030430 |
7 | 12326320366200 |
oct | 1722366656122 |
9 | 415876806500 |
10 | 131329645650 |
11 | 50773185635 |
12 | 21552048416 |
13 | c4cc4bc3c8 |
14 | 64dbd06070 |
15 | 363995c900 |
hex | 1e93db5c52 |
131329645650 has 180 divisors, whose sum is σ = 424478306538. Its totient is φ = 30018159360.
The previous prime is 131329645627. The next prime is 131329645661. The reversal of 131329645650 is 56546923131.
131329645650 is a `hidden beast` number, since 1 + 3 + 1 + 3 + 29 + 64 + 565 + 0 = 666.
It can be written as a sum of positive squares in 3 ways, for example, as 94480620129 + 36849025521 = 307377^2 + 191961^2 .
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a junction number, because it is equal to n+sod(n) for n = 131329645596 and 131329645605.
It is an unprimeable number.
It is a polite number, since it can be written in 89 ways as a sum of consecutive naturals, for example, 132439 + ... + 529338.
Almost surely, 2131329645650 is an apocalyptic number.
131329645650 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
131329645650 is an abundant number, since it is smaller than the sum of its proper divisors (293148660888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131329645650 is a wasteful number, since it uses less digits than its factorization.
131329645650 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 661815 (or 661794 counting only the distinct ones).
The product of its (nonzero) digits is 583200, while the sum is 45.
The spelling of 131329645650 in words is "one hundred thirty-one billion, three hundred twenty-nine million, six hundred forty-five thousand, six hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •