Base | Representation |
---|---|
bin | 11110000010110100110001… |
… | …100010101101110011101000 |
3 | 122022212000211012002122110020 |
4 | 132002310301202231303220 |
5 | 114304402001002424134 |
6 | 1145010113303120440 |
7 | 36555321604455222 |
oct | 3602646142556350 |
9 | 568760735078406 |
10 | 132135500045544 |
11 | 39114395012826 |
12 | 129a08b3743120 |
13 | 589642a31c6a8 |
14 | 248b56c783412 |
15 | 10422331b7b49 |
hex | 782d318adce8 |
132135500045544 has 64 divisors (see below), whose sum is σ = 331074536163840. Its totient is φ = 43947170841600.
The previous prime is 132135500045513. The next prime is 132135500045551. The reversal of 132135500045544 is 445540005531231.
It is a junction number, because it is equal to n+sod(n) for n = 132135500045496 and 132135500045505.
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, 16002844 + ... + 22811444.
It is an arithmetic number, because the mean of its divisors is an integer number (5173039627560).
Almost surely, 2132135500045544 is an apocalyptic number.
It is an amenable number.
132135500045544 is an abundant number, since it is smaller than the sum of its proper divisors (198939036118296).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132135500045544 is a wasteful number, since it uses less digits than its factorization.
132135500045544 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6810410 (or 6810406 counting only the distinct ones).
The product of its (nonzero) digits is 720000, while the sum is 42.
Adding to 132135500045544 its reverse (445540005531231), we get a palindrome (577675505576775).
The spelling of 132135500045544 in words is "one hundred thirty-two trillion, one hundred thirty-five billion, five hundred million, forty-five thousand, five hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •