Base | Representation |
---|---|
bin | 11110000010011101111101… |
… | …110101001010000011000100 |
3 | 122022202200121110000202210110 |
4 | 132002131331311022003010 |
5 | 114304001322044110302 |
6 | 1144550543223353020 |
7 | 36553463662651533 |
oct | 3602357565120304 |
9 | 568680543022713 |
10 | 132111010144452 |
11 | 39104a68110649 |
12 | 12997bb9bb2770 |
13 | 5894026695b61 |
14 | 248a2c806031a |
15 | 104179d1a5b6c |
hex | 78277dd4a0c4 |
132111010144452 has 12 divisors (see below), whose sum is σ = 308259023670416. Its totient is φ = 44037003381480.
The previous prime is 132111010144447. The next prime is 132111010144481. The reversal of 132111010144452 is 254441010111231.
It is a tau number, because it is divible by the number of its divisors (12).
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 3 ways as a sum of consecutive naturals, for example, 5504625422674 + ... + 5504625422697.
Almost surely, 2132111010144452 is an apocalyptic number.
132111010144452 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
132111010144452 is an abundant number, since it is smaller than the sum of its proper divisors (176148013525964).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132111010144452 is a wasteful number, since it uses less digits than its factorization.
132111010144452 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11009250845378 (or 11009250845376 counting only the distinct ones).
The product of its (nonzero) digits is 3840, while the sum is 30.
Adding to 132111010144452 its reverse (254441010111231), we get a palindrome (386552020255683).
The spelling of 132111010144452 in words is "one hundred thirty-two trillion, one hundred eleven billion, ten million, one hundred forty-four thousand, four hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •