Base | Representation |
---|---|
bin | 11111000010000101100… |
… | …000000011001000111101 |
3 | 21112212110121220211020221 |
4 | 133002011200003020331 |
5 | 234414422122100023 |
6 | 4311402121141341 |
7 | 310033263043102 |
oct | 37020540031075 |
9 | 7485417824227 |
10 | 2132543550013 |
11 | 752452269768 |
12 | 2a537462a851 |
13 | 1261373a5986 |
14 | 75303aa4aa9 |
15 | 3a7142c085d |
hex | 1f08580323d |
2132543550013 has 4 divisors (see below), whose sum is σ = 2132546855868. Its totient is φ = 2132540244160.
The previous prime is 2132543550001. The next prime is 2132543550023. The reversal of 2132543550013 is 3100553452312.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 309444100729 + 1823099449284 = 556277^2 + 1350222^2 .
It is a cyclic number.
It is not a de Polignac number, because 2132543550013 - 221 = 2132541452861 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2132543550023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 335068 + ... + 2092213.
It is an arithmetic number, because the mean of its divisors is an integer number (533136713967).
Almost surely, 22132543550013 is an apocalyptic number.
It is an amenable number.
2132543550013 is a deficient number, since it is larger than the sum of its proper divisors (3305855).
2132543550013 is an equidigital number, since it uses as much as digits as its factorization.
2132543550013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3305854.
The product of its (nonzero) digits is 54000, while the sum is 34.
The spelling of 2132543550013 in words is "two trillion, one hundred thirty-two billion, five hundred forty-three million, five hundred fifty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •