Base | Representation |
---|---|
bin | 11110101111011100110100… |
… | …010010000010101010010001 |
3 | 122201201012101111000022220002 |
4 | 132233130310102002222101 |
5 | 120210123002034434010 |
6 | 1155315002251255345 |
7 | 40323014244532325 |
oct | 3657346422025221 |
9 | 581635344008802 |
10 | 135202152655505 |
11 | 3a096a02508921 |
12 | 131b70bb44a555 |
13 | 5a5967b931470 |
14 | 2555b6789b985 |
15 | 1096db92081a5 |
hex | 7af734482a91 |
135202152655505 has 32 divisors (see below), whose sum is σ = 185001773741568. Its totient is φ = 93967955020800.
The previous prime is 135202152655501. The next prime is 135202152655543. The reversal of 135202152655505 is 505556251202531.
It is not a de Polignac number, because 135202152655505 - 22 = 135202152655501 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 135202152655505.
It is not an unprimeable number, because it can be changed into a prime (135202152655501) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 239271860 + ... + 239836250.
It is an arithmetic number, because the mean of its divisors is an integer number (5781305429424).
Almost surely, 2135202152655505 is an apocalyptic number.
It is an amenable number.
135202152655505 is a deficient number, since it is larger than the sum of its proper divisors (49799621086063).
135202152655505 is a wasteful number, since it uses less digits than its factorization.
135202152655505 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 781217.
The product of its (nonzero) digits is 2250000, while the sum is 47.
The spelling of 135202152655505 in words is "one hundred thirty-five trillion, two hundred two billion, one hundred fifty-two million, six hundred fifty-five thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •