Base | Representation |
---|---|
bin | 1100010101000011000100… |
… | …1110010111110001011001 |
3 | 1202222220202000022121100111 |
4 | 3011100301032113301121 |
5 | 3234044130103342040 |
6 | 44455231110004321 |
7 | 2566240640153122 |
oct | 305206116276131 |
9 | 52886660277314 |
10 | 13555742637145 |
11 | 4356a5a359555 |
12 | 162b23a9466a1 |
13 | 7743bb521b47 |
14 | 34c15c513049 |
15 | 187938dabdea |
hex | c5431397c59 |
13555742637145 has 8 divisors (see below), whose sum is σ = 16273069262856. Its totient is φ = 10840475377536.
The previous prime is 13555742637137. The next prime is 13555742637193. The reversal of 13555742637145 is 54173624755531.
It can be written as a sum of positive squares in 4 ways, for example, as 322655808784 + 13233086828361 = 568028^2 + 3637731^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 13555742637145 - 23 = 13555742637137 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 13555742637145.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 514827042 + ... + 514853371.
It is an arithmetic number, because the mean of its divisors is an integer number (2034133657857).
Almost surely, 213555742637145 is an apocalyptic number.
It is an amenable number.
13555742637145 is a deficient number, since it is larger than the sum of its proper divisors (2717326625711).
13555742637145 is a wasteful number, since it uses less digits than its factorization.
13555742637145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1029683051.
The product of its digits is 52920000, while the sum is 58.
The spelling of 13555742637145 in words is "thirteen trillion, five hundred fifty-five billion, seven hundred forty-two million, six hundred thirty-seven thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •