Base | Representation |
---|---|
bin | 11110110101101001111001… |
… | …111011110110010010011111 |
3 | 122210012221220222001020221001 |
4 | 132311221321323312102133 |
5 | 120234114203342130322 |
6 | 1200242514443451131 |
7 | 40365560143646110 |
oct | 3665517173662237 |
9 | 583187828036831 |
10 | 135628523005087 |
11 | 3a240808454162 |
12 | 13265871b26aa7 |
13 | 5a8a93a672948 |
14 | 256c653ddc207 |
15 | 10a3020c5d827 |
hex | 7b5a79ef649f |
135628523005087 has 8 divisors (see below), whose sum is σ = 161743331782656. Its totient is φ = 111198540600312.
The previous prime is 135628523005049. The next prime is 135628523005093. The reversal of 135628523005087 is 780500325826531.
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 135628523005087 - 243 = 126832429982879 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 (135628523005687) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 421206593023 + ... + 421206593344.
It is an arithmetic number, because the mean of its divisors is an integer number (20217916472832).
Almost surely, 2135628523005087 is an apocalyptic number.
135628523005087 is a deficient number, since it is larger than the sum of its proper divisors (26114808777569).
135628523005087 is an equidigital number, since it uses as much as digits as its factorization.
135628523005087 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 842413186397.
The product of its (nonzero) digits is 12096000, while the sum is 55.
The spelling of 135628523005087 in words is "one hundred thirty-five trillion, six hundred twenty-eight billion, five hundred twenty-three million, five thousand, eighty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •