Base | Representation |
---|---|
bin | 11110110101100010011111… |
… | …101011111110010001011111 |
3 | 122210012012101110101000210011 |
4 | 132311202133223332101133 |
5 | 120234001410002134403 |
6 | 1200235121135024051 |
7 | 40365156031203310 |
oct | 3665423753762137 |
9 | 583165343330704 |
10 | 135620566443103 |
11 | 3a2383a51553a5 |
12 | 1326421136b027 |
13 | 5a89c7012b1c1 |
14 | 256c0db400607 |
15 | 10a2c07493a6d |
hex | 7b589fafe45f |
135620566443103 has 8 divisors (see below), whose sum is σ = 163152561134720. Its totient is φ = 110127978765720.
The previous prime is 135620566443079. The next prime is 135620566443107. The reversal of 135620566443103 is 301344665026531.
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 135620566443103 - 221 = 135620564345951 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (135620566443107) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 509851753413 + ... + 509851753678.
It is an arithmetic number, because the mean of its divisors is an integer number (20394070141840).
Almost surely, 2135620566443103 is an apocalyptic number.
135620566443103 is a deficient number, since it is larger than the sum of its proper divisors (27531994691617).
135620566443103 is a wasteful number, since it uses less digits than its factorization.
135620566443103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1019703507117.
The product of its (nonzero) digits is 4665600, while the sum is 49.
The spelling of 135620566443103 in words is "one hundred thirty-five trillion, six hundred twenty billion, five hundred sixty-six million, four hundred forty-three thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •