Base | Representation |
---|---|
bin | 11110110100000110110011… |
… | …000000110000111001111001 |
3 | 122202211210020121110020122011 |
4 | 132310012303000300321321 |
5 | 120230343233220201130 |
6 | 1200121555102525521 |
7 | 40355102063563060 |
oct | 3664066300607171 |
9 | 582753217406564 |
10 | 135522106412665 |
11 | 3a1aa66a01a215 |
12 | 132491132968a1 |
13 | 5a808ab69676b |
14 | 256743aac91d7 |
15 | 10a039354b52a |
hex | 7b41b3030e79 |
135522106412665 has 16 divisors (see below), whose sum is σ = 186739736618880. Its totient is φ = 92489020485120.
The previous prime is 135522106412659. The next prime is 135522106412711. The reversal of 135522106412665 is 566214601225531.
It is not a de Polignac number, because 135522106412665 - 211 = 135522106410617 is a prime.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 9175490680 + ... + 9175505449.
It is an arithmetic number, because the mean of its divisors is an integer number (11671233538680).
Almost surely, 2135522106412665 is an apocalyptic number.
It is an amenable number.
135522106412665 is a deficient number, since it is larger than the sum of its proper divisors (51217630206215).
135522106412665 is a wasteful number, since it uses less digits than its factorization.
135522106412665 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18350996352.
The product of its (nonzero) digits is 2592000, while the sum is 49.
The spelling of 135522106412665 in words is "one hundred thirty-five trillion, five hundred twenty-two billion, one hundred six million, four hundred twelve thousand, six hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.168 sec. • engine limits •