Base | Representation |
---|---|
bin | 11110000001101000011100… |
… | …001000110101101111110010 |
3 | 122022120012021000100021121112 |
4 | 132001220130020311233302 |
5 | 114302031120324442122 |
6 | 1144504320205153322 |
7 | 36546360511401245 |
oct | 3601503410655762 |
9 | 568505230307545 |
10 | 132053536562162 |
11 | 39092654840606 |
12 | 12988a3a25b842 |
13 | 588b7974876b7 |
14 | 24875d4d3725c |
15 | 104003764b2e2 |
hex | 781a1c235bf2 |
132053536562162 has 16 divisors (see below), whose sum is σ = 198130270506840. Its totient is φ = 66010115119872.
The previous prime is 132053536562153. The next prime is 132053536562173. The reversal of 132053536562162 is 261265635350231.
132053536562162 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 4 ways, for example, as 49665438011641 + 82388098550521 = 7047371^2 + 9076789^2 .
It is a super-2 number, since 2×1320535365621622 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 132053536562162.
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 7 ways as a sum of consecutive naturals, for example, 129771164 + ... + 130784792.
Almost surely, 2132053536562162 is an apocalyptic number.
132053536562162 is a deficient number, since it is larger than the sum of its proper divisors (66076733944678).
132053536562162 is a wasteful number, since it uses less digits than its factorization.
132053536562162 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1029997.
The product of its (nonzero) digits is 5832000, while the sum is 50.
The spelling of 132053536562162 in words is "one hundred thirty-two trillion, fifty-three billion, five hundred thirty-six million, five hundred sixty-two thousand, one hundred sixty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •