Base | Representation |
---|---|
bin | 11110000010011101111110… |
… | …100010111000100001100100 |
3 | 122022202200122021120202122210 |
4 | 132002131332202320201210 |
5 | 114304001333131200200 |
6 | 1144550544332323420 |
7 | 36553464166564602 |
oct | 3602357642704144 |
9 | 568680567522583 |
10 | 132111022131300 |
11 | 39104a73958533 |
12 | 12998002013570 |
13 | 5894029001b74 |
14 | 248a2c98a0872 |
15 | 104179e272650 |
hex | 78277e8b8864 |
132111022131300 has 72 divisors (see below), whose sum is σ = 384052793999392. Its totient is φ = 35062640928000.
The previous prime is 132111022131259. The next prime is 132111022131329. The reversal of 132111022131300 is 3131220111231.
It is a super-3 number, since 3×1321110221313003 (a number of 43 digits) contains 333 as substring.
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 23 ways as a sum of consecutive naturals, for example, 1043467681 + ... + 1043594280.
Almost surely, 2132111022131300 is an apocalyptic number.
132111022131300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
132111022131300 is an abundant number, since it is smaller than the sum of its proper divisors (251941771868092).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132111022131300 is a wasteful number, since it uses less digits than its factorization.
132111022131300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2087062189 (or 2087062182 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 132111022131300 its reverse (3131220111231), we get a palindrome (135242242242531).
The spelling of 132111022131300 in words is "one hundred thirty-two trillion, one hundred eleven billion, twenty-two million, one hundred thirty-one thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •