Base | Representation |
---|---|
bin | 11110000010111110001100… |
… | …111000111110101011000001 |
3 | 122022212222221122100210112221 |
4 | 132002332030320332223001 |
5 | 114310033213332334131 |
6 | 1145014505543251041 |
7 | 36556130500332562 |
oct | 3602761470765301 |
9 | 568788848323487 |
10 | 132145622543041 |
11 | 39118709994a38 |
12 | 129a2859749a81 |
13 | 58973814c9793 |
14 | 248bc4ccb2169 |
15 | 1042626bc1411 |
hex | 782f8ce3eac1 |
132145622543041 has 8 divisors (see below), whose sum is σ = 135815640782720. Its totient is φ = 128525536524528.
The previous prime is 132145622543023. The next prime is 132145622543059. The reversal of 132145622543041 is 140345226541231.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (132145622543023) and next prime (132145622543059).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 132145622543041 - 25 = 132145622543009 is a prime.
It is not an unprimeable number, because it can be changed into a prime (132145622543071) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 12483049926 + ... + 12483060511.
It is an arithmetic number, because the mean of its divisors is an integer number (16976955097840).
Almost surely, 2132145622543041 is an apocalyptic number.
It is an amenable number.
132145622543041 is a deficient number, since it is larger than the sum of its proper divisors (3670018239679).
132145622543041 is an equidigital number, since it uses as much as digits as its factorization.
132145622543041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24966110583.
The product of its (nonzero) digits is 691200, while the sum is 43.
The spelling of 132145622543041 in words is "one hundred thirty-two trillion, one hundred forty-five billion, six hundred twenty-two million, five hundred forty-three thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •