Base | Representation |
---|---|
bin | 1011111101101110001101… |
… | …1111010101110100001001 |
3 | 1201120121101000120210210120 |
4 | 2333123203133111310021 |
5 | 3211012423131113301 |
6 | 43551154311533453 |
7 | 2525263216216662 |
oct | 277334337256411 |
9 | 51517330523716 |
10 | 13155006504201 |
11 | 4212009248621 |
12 | 158564108a289 |
13 | 745686532aa3 |
14 | 3369c468c369 |
15 | 17c2d2a54e36 |
hex | bf6e37d5d09 |
13155006504201 has 16 divisors (see below), whose sum is σ = 18468899403840. Its totient is φ = 8305845589440.
The previous prime is 13155006504169. The next prime is 13155006504307. The reversal of 13155006504201 is 10240560055131.
It is not a de Polignac number, because 13155006504201 - 25 = 13155006504169 is a prime.
It is a super-2 number, since 2×131550065042012 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (13155006504001) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 35642170 + ... + 36009363.
It is an arithmetic number, because the mean of its divisors is an integer number (1154306212740).
Almost surely, 213155006504201 is an apocalyptic number.
It is an amenable number.
13155006504201 is a deficient number, since it is larger than the sum of its proper divisors (5313892899639).
13155006504201 is a wasteful number, since it uses less digits than its factorization.
13155006504201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 71654776.
The product of its (nonzero) digits is 18000, while the sum is 33.
Adding to 13155006504201 its reverse (10240560055131), we get a palindrome (23395566559332).
The spelling of 13155006504201 in words is "thirteen trillion, one hundred fifty-five billion, six million, five hundred four thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •