Base | Representation |
---|---|
bin | 11110000000110110110111… |
… | …100101101100110011010100 |
3 | 122022101002212120012212001110 |
4 | 132000312313211230303110 |
5 | 114300143113331140312 |
6 | 1144424034423455020 |
7 | 36542464510305024 |
oct | 3600666745546324 |
9 | 568332776185043 |
10 | 132000310021332 |
11 | 39072020847695 |
12 | 1297a6648b7470 |
13 | 588676411581c |
14 | 2484bc5cada84 |
15 | 103d96e8b443c |
hex | 780db796ccd4 |
132000310021332 has 24 divisors (see below), whose sum is σ = 308297162992000. Its totient is φ = 43957754824896.
The previous prime is 132000310021213. The next prime is 132000310021403. The reversal of 132000310021332 is 233120013000231.
It is a super-2 number, since 2×1320003100213322 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 132000310021299 and 132000310021308.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5293551457 + ... + 5293576392.
Almost surely, 2132000310021332 is an apocalyptic number.
132000310021332 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
132000310021332 is an abundant number, since it is smaller than the sum of its proper divisors (176296852970668).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132000310021332 is a wasteful number, since it uses less digits than its factorization.
132000310021332 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10587128895 (or 10587128893 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 132000310021332 its reverse (233120013000231), we get a palindrome (365120323021563).
The spelling of 132000310021332 in words is "one hundred thirty-two trillion, three hundred ten million, twenty-one thousand, three hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •