Base | Representation |
---|---|
bin | 101110111011110100110… |
… | …001010100110101111111 |
3 | 102102100010221021002022100 |
4 | 232323310301110311333 |
5 | 410320440000340020 |
6 | 10505410323120143 |
7 | 452010510010206 |
oct | 56736461246577 |
9 | 12370127232270 |
10 | 3225332043135 |
11 | 1033945943914 |
12 | 441111213053 |
13 | 1a51bc0c22c7 |
14 | b216d4b623d |
15 | 58d71ac8a90 |
hex | 2eef4c54d7f |
3225332043135 has 48 divisors (see below), whose sum is σ = 5787802369440. Its totient is φ = 1659583161600.
The previous prime is 3225332043133. The next prime is 3225332043163. The reversal of 3225332043135 is 5313402335223.
3225332043135 is a `hidden beast` number, since 3 + 2 + 2 + 5 + 332 + 0 + 4 + 313 + 5 = 666.
It is not a de Polignac number, because 3225332043135 - 21 = 3225332043133 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 3225332043135.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3225332043133) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 747952 + ... + 2647658.
It is an arithmetic number, because the mean of its divisors is an integer number (120579216030).
Almost surely, 23225332043135 is an apocalyptic number.
3225332043135 is a deficient number, since it is larger than the sum of its proper divisors (2562470326305).
3225332043135 is a wasteful number, since it uses less digits than its factorization.
3225332043135 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1901048 (or 1901045 counting only the distinct ones).
The product of its (nonzero) digits is 194400, while the sum is 36.
Adding to 3225332043135 its reverse (5313402335223), we get a palindrome (8538734378358).
The spelling of 3225332043135 in words is "three trillion, two hundred twenty-five billion, three hundred thirty-two million, forty-three thousand, one hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •