Base | Representation |
---|---|
bin | 11110000011000011010101… |
… | …001010110110011010011010 |
3 | 122022220112011110220110100002 |
4 | 132003003111022312122122 |
5 | 114310131003304422100 |
6 | 1145021220250413002 |
7 | 36556414125265355 |
oct | 3603032512663232 |
9 | 568815143813302 |
10 | 132151130154650 |
11 | 3911aa85888072 |
12 | 129a3936131162 |
13 | 5897a4b576b69 |
14 | 248c21254b29c |
15 | 104284a4962d5 |
hex | 7830d52b669a |
132151130154650 has 48 divisors (see below), whose sum is σ = 262159698636216. Its totient is φ = 49387867576320.
The previous prime is 132151130154643. The next prime is 132151130154671. The reversal of 132151130154650 is 56451031151231.
132151130154650 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 12 ways, for example, as 39255826109809 + 92895304044841 = 6265447^2 + 9638221^2 .
It is a Curzon number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 567299309 + ... + 567532208.
Almost surely, 2132151130154650 is an apocalyptic number.
132151130154650 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
132151130154650 is a deficient number, since it is larger than the sum of its proper divisors (130008568481566).
132151130154650 is a wasteful number, since it uses less digits than its factorization.
132151130154650 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1134831683 (or 1134831678 counting only the distinct ones).
The product of its (nonzero) digits is 54000, while the sum is 38.
The spelling of 132151130154650 in words is "one hundred thirty-two trillion, one hundred fifty-one billion, one hundred thirty million, one hundred fifty-four thousand, six hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.289 sec. • engine limits •