Base | Representation |
---|---|
bin | 11110110100100000111110… |
… | …010111111000100011101101 |
3 | 122202221110210111102101021102 |
4 | 132310200332113320203231 |
5 | 120231323314330411000 |
6 | 1200142524144412445 |
7 | 40360115450014016 |
oct | 3664407627704355 |
9 | 582843714371242 |
10 | 135550214310125 |
11 | 3a21058321163a |
12 | 13252658617125 |
13 | 5a8343aa61854 |
14 | 2568945b2400d |
15 | 10a0e8aec73d5 |
hex | 7b483e5f88ed |
135550214310125 has 16 divisors (see below), whose sum is σ = 169167000096432. Its totient is φ = 108439958219200.
The previous prime is 135550214310101. The next prime is 135550214310191. The reversal of 135550214310125 is 521013412055531.
It can be written as a sum of positive squares in 8 ways, for example, as 24009980400004 + 111540233910121 = 4899998^2 + 10561261^2 .
It is not a de Polignac number, because 135550214310125 - 26 = 135550214310061 is a prime.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 104044247 + ... + 105339003.
It is an arithmetic number, because the mean of its divisors is an integer number (10572937506027).
Almost surely, 2135550214310125 is an apocalyptic number.
It is an amenable number.
135550214310125 is a deficient number, since it is larger than the sum of its proper divisors (33616785786307).
135550214310125 is an equidigital number, since it uses as much as digits as its factorization.
135550214310125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2132305 (or 2132295 counting only the distinct ones).
The product of its (nonzero) digits is 90000, while the sum is 38.
Adding to 135550214310125 its reverse (521013412055531), we get a palindrome (656563626365656).
The spelling of 135550214310125 in words is "one hundred thirty-five trillion, five hundred fifty billion, two hundred fourteen million, three hundred ten thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.116 sec. • engine limits •