Base | Representation |
---|---|
bin | 11110000010011111111011… |
… | …100111010110000000100011 |
3 | 122022202220001111221112102002 |
4 | 132002133323213112000203 |
5 | 114304020132313441033 |
6 | 1144551532450514215 |
7 | 36553600166200541 |
oct | 3602377347260043 |
9 | 568686044845362 |
10 | 132113120452643 |
11 | 3910595034a400 |
12 | 129984a889596b |
13 | 58942a1952925 |
14 | 248a448430d91 |
15 | 10418735a73e8 |
hex | 7827fb9d6023 |
132113120452643 has 12 divisors (see below), whose sum is σ = 145221306719664. Its totient is φ = 120097825887600.
The previous prime is 132113120452571. The next prime is 132113120452697. The reversal of 132113120452643 is 346254021311231.
It is not a de Polignac number, because 132113120452643 - 210 = 132113120451619 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 132113120452597 and 132113120452606.
It is not an unprimeable number, because it can be changed into a prime (132113120452043) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 19863071 + ... + 25666472.
It is an arithmetic number, because the mean of its divisors is an integer number (12101775559972).
Almost surely, 2132113120452643 is an apocalyptic number.
132113120452643 is a deficient number, since it is larger than the sum of its proper divisors (13108186267021).
132113120452643 is a wasteful number, since it uses less digits than its factorization.
132113120452643 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45553546 (or 45553535 counting only the distinct ones).
The product of its (nonzero) digits is 103680, while the sum is 38.
Adding to 132113120452643 its reverse (346254021311231), we get a palindrome (478367141763874).
The spelling of 132113120452643 in words is "one hundred thirty-two trillion, one hundred thirteen billion, one hundred twenty million, four hundred fifty-two thousand, six hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •