Base | Representation |
---|---|
bin | 11110101110100101000110… |
… | …000001011011001001110111 |
3 | 122201111110221200201110111111 |
4 | 132232211012001123021313 |
5 | 120203132433102402002 |
6 | 1155231305230015451 |
7 | 40315465455644551 |
oct | 3656450601331167 |
9 | 581443850643444 |
10 | 135142320747127 |
11 | 3a0735999aa561 |
12 | 131a75a1947587 |
13 | 5a53b34c68a95 |
14 | 2552ccd4824d1 |
15 | 109556660a3d7 |
hex | 7ae94605b277 |
135142320747127 has 8 divisors (see below), whose sum is σ = 147160421866800. Its totient is φ = 123614754367104.
The previous prime is 135142320747061. The next prime is 135142320747169. The reversal of 135142320747127 is 721747023241531.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-135142320747127 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 (135142320717127) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 122633684338 + ... + 122633685439.
It is an arithmetic number, because the mean of its divisors is an integer number (18395052733350).
Almost surely, 2135142320747127 is an apocalyptic number.
135142320747127 is a deficient number, since it is larger than the sum of its proper divisors (12018101119673).
135142320747127 is a wasteful number, since it uses less digits than its factorization.
135142320747127 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 245267369825.
The product of its (nonzero) digits is 1975680, while the sum is 49.
Adding to 135142320747127 its reverse (721747023241531), we get a palindrome (856889343988658).
The spelling of 135142320747127 in words is "one hundred thirty-five trillion, one hundred forty-two billion, three hundred twenty million, seven hundred forty-seven thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •