Base | Representation |
---|---|
bin | 11110000011000010111000… |
… | …100011011001010111100100 |
3 | 122022220110221000111121121010 |
4 | 132003002320203121113210 |
5 | 114310124012403100040 |
6 | 1145021100500222220 |
7 | 36556366205413410 |
oct | 3603027043312744 |
9 | 568813830447533 |
10 | 132150650050020 |
11 | 3911a85987a388 |
12 | 129a382139a970 |
13 | 58979a2c69694 |
14 | 248c1a8893d40 |
15 | 104281d25ce80 |
hex | 7830b88d95e4 |
132150650050020 has 48 divisors (see below), whose sum is σ = 422882080161408. Its totient is φ = 30205862868480.
The previous prime is 132150650049941. The next prime is 132150650050039. The reversal of 132150650050020 is 20050056051231.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a self number, because there is not a number n which added to its sum of digits gives 132150650050020.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 157322202021 + ... + 157322202860.
It is an arithmetic number, because the mean of its divisors is an integer number (8810043336696).
Almost surely, 2132150650050020 is an apocalyptic number.
132150650050020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
132150650050020 is an abundant number, since it is smaller than the sum of its proper divisors (290731430111388).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132150650050020 is a wasteful number, since it uses less digits than its factorization.
132150650050020 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 314644404900 (or 314644404898 counting only the distinct ones).
The product of its (nonzero) digits is 9000, while the sum is 30.
The spelling of 132150650050020 in words is "one hundred thirty-two trillion, one hundred fifty billion, six hundred fifty million, fifty thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •