Base | Representation |
---|---|
bin | 1011111101001110101001… |
… | …0010011101011100100101 |
3 | 1201112210111022201222000211 |
4 | 2333103222102131130211 |
5 | 3210343043320233014 |
6 | 43543233252335421 |
7 | 2524543166420500 |
oct | 277235222353445 |
9 | 51483438658024 |
10 | 13146530633509 |
11 | 42094598a4509 |
12 | 1583a76614571 |
13 | 7449355356a0 |
14 | 33641cb10137 |
15 | 17be888aacc4 |
hex | bf4ea49d725 |
13146530633509 has 192 divisors, whose sum is σ = 17722327203840. Its totient is φ = 9650636835840.
The previous prime is 13146530633507. The next prime is 13146530633569. The reversal of 13146530633509 is 90533603564131.
It is not a de Polignac number, because 13146530633509 - 21 = 13146530633507 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (49).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13146530633501) by changing a digit.
It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 7630022722 + ... + 7630024444.
It is an arithmetic number, because the mean of its divisors is an integer number (92303787520).
Almost surely, 213146530633509 is an apocalyptic number.
It is an amenable number.
13146530633509 is a deficient number, since it is larger than the sum of its proper divisors (4575796570331).
13146530633509 is a wasteful number, since it uses less digits than its factorization.
13146530633509 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2000 (or 1993 counting only the distinct ones).
The product of its (nonzero) digits is 2624400, while the sum is 49.
The spelling of 13146530633509 in words is "thirteen trillion, one hundred forty-six billion, five hundred thirty million, six hundred thirty-three thousand, five hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •