Base | Representation |
---|---|
bin | 11110000011000010111000… |
… | …100011011010000000101010 |
3 | 122022220110221000111202012112 |
4 | 132003002320203122000222 |
5 | 114310124012403141100 |
6 | 1145021100500242322 |
7 | 36556366205424155 |
oct | 3603027043320052 |
9 | 568813830452175 |
10 | 132150650052650 |
11 | 3911a859881359 |
12 | 129a38213a03a2 |
13 | 58979a2c6a938 |
14 | 248c1a8894c9c |
15 | 104281d25db35 |
hex | 7830b88da02a |
132150650052650 has 96 divisors (see below), whose sum is σ = 252559062685440. Its totient is φ = 51414772032000.
The previous prime is 132150650052647. The next prime is 132150650052677. The reversal of 132150650052650 is 56250056051231.
It is a Harshad number since it is a multiple of its sum of digits (41).
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 132150650052598 and 132150650052607.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1029234656 + ... + 1029363044.
It is an arithmetic number, because the mean of its divisors is an integer number (2630823569640).
Almost surely, 2132150650052650 is an apocalyptic number.
132150650052650 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
132150650052650 is a deficient number, since it is larger than the sum of its proper divisors (120408412632790).
132150650052650 is a wasteful number, since it uses less digits than its factorization.
132150650052650 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 129960 (or 129955 counting only the distinct ones).
The product of its (nonzero) digits is 270000, while the sum is 41.
The spelling of 132150650052650 in words is "one hundred thirty-two trillion, one hundred fifty billion, six hundred fifty million, fifty-two thousand, six hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •