Base | Representation |
---|---|
bin | 11110010001010101010110… |
… | …000001100000110110111101 |
3 | 122110101100100221011101022111 |
4 | 132101111112001200312331 |
5 | 114422220422343331141 |
6 | 1151052125134214021 |
7 | 40020336363546550 |
oct | 3621252601406675 |
9 | 573340327141274 |
10 | 133132544511421 |
11 | 39469216689134 |
12 | 12b21b8b954311 |
13 | 59394641a2170 |
14 | 24c391447a697 |
15 | 105d13a220381 |
hex | 791556060dbd |
133132544511421 has 16 divisors (see below), whose sum is σ = 164047532623744. Its totient is φ = 105212151111744.
The previous prime is 133132544511389. The next prime is 133132544511443. The reversal of 133132544511421 is 124115445231331.
It is a cyclic number.
It is not a de Polignac number, because 133132544511421 - 25 = 133132544511389 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133132544011421) by changing a digit.
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, 857480991 + ... + 857636236.
It is an arithmetic number, because the mean of its divisors is an integer number (10252970788984).
Almost surely, 2133132544511421 is an apocalyptic number.
It is an amenable number.
133132544511421 is a deficient number, since it is larger than the sum of its proper divisors (30914988112323).
133132544511421 is a wasteful number, since it uses less digits than its factorization.
133132544511421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1715118100.
The product of its digits is 172800, while the sum is 40.
Adding to 133132544511421 its reverse (124115445231331), we get a palindrome (257247989742752).
The spelling of 133132544511421 in words is "one hundred thirty-three trillion, one hundred thirty-two billion, five hundred forty-four million, five hundred eleven thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •