Base | Representation |
---|---|
bin | 11110111100101111011101… |
… | …100011001011100010000111 |
3 | 122211221111222000021120122001 |
4 | 132330233131203023202013 |
5 | 120320104044021031201 |
6 | 1201254335330450131 |
7 | 40446010420261021 |
oct | 3674573543134207 |
9 | 584844860246561 |
10 | 136115525564551 |
11 | 3a4092a7725165 |
12 | 13324126133947 |
13 | 5ac483cb069b0 |
14 | 2588052d61011 |
15 | 10b0a25798301 |
hex | 7bcbdd8cb887 |
136115525564551 has 8 divisors (see below), whose sum is σ = 147655921052304. Its totient is φ = 124727982997440.
The previous prime is 136115525564489. The next prime is 136115525564651. The reversal of 136115525564551 is 155465525511631.
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 136115525564551 - 229 = 136114988693639 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 136115525564492 and 136115525564501.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (136115525564651) 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, 38213228305 + ... + 38213231866.
It is an arithmetic number, because the mean of its divisors is an integer number (18456990131538).
Almost surely, 2136115525564551 is an apocalyptic number.
136115525564551 is a deficient number, since it is larger than the sum of its proper divisors (11540395487753).
136115525564551 is a wasteful number, since it uses less digits than its factorization.
136115525564551 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 76426460321.
The product of its digits is 13500000, while the sum is 55.
The spelling of 136115525564551 in words is "one hundred thirty-six trillion, one hundred fifteen billion, five hundred twenty-five million, five hundred sixty-four thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •