Base | Representation |
---|---|
bin | 11110000010011110001111… |
… | …001011111010000110010000 |
3 | 122022202201100201221002001220 |
4 | 132002132033023322012100 |
5 | 114304002421114233404 |
6 | 1144551032144325040 |
7 | 36553504126632210 |
oct | 3602361713720620 |
9 | 568681321832056 |
10 | 132111301321104 |
11 | 391050a7508a06 |
12 | 1299807b613780 |
13 | 5894071ac4831 |
14 | 248a3149b8240 |
15 | 10417b8a204d9 |
hex | 78278f2fa190 |
132111301321104 has 80 divisors (see below), whose sum is σ = 390700635380352. Its totient is φ = 37682433275904.
The previous prime is 132111301321091. The next prime is 132111301321123. The reversal of 132111301321104 is 401123103111231.
It is a Harshad number since it is a multiple of its sum of digits (24).
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 15 ways as a sum of consecutive naturals, for example, 331325539 + ... + 331724034.
Almost surely, 2132111301321104 is an apocalyptic number.
132111301321104 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
132111301321104 is an abundant number, since it is smaller than the sum of its proper divisors (258589334059248).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132111301321104 is a wasteful number, since it uses less digits than its factorization.
132111301321104 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 663050184 (or 663050178 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 24.
Adding to 132111301321104 its reverse (401123103111231), we get a palindrome (533234404432335).
The spelling of 132111301321104 in words is "one hundred thirty-two trillion, one hundred eleven billion, three hundred one million, three hundred twenty-one thousand, one hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •