Base | Representation |
---|---|
bin | 10000000110001… |
… | …01001111011111 |
3 | 100102002000100022 |
4 | 20003011033133 |
5 | 234031310011 |
6 | 21222022355 |
7 | 3226461506 |
oct | 1003051737 |
9 | 312060308 |
10 | 135025631 |
11 | 6a244834 |
12 | 392779bb |
13 | 21c88130 |
14 | 13d0b83d |
15 | bcc28db |
hex | 80c53df |
135025631 has 4 divisors (see below), whose sum is σ = 145412232. Its totient is φ = 124639032.
The previous prime is 135025613. The next prime is 135025637. The reversal of 135025631 is 136520531.
135025631 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 135025631 - 210 = 135024607 is a prime.
It is a super-2 number, since 2×1350256312 = 36463842053896322, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 135025631.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (135025637) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5193281 + ... + 5193306.
It is an arithmetic number, because the mean of its divisors is an integer number (36353058).
Almost surely, 2135025631 is an apocalyptic number.
135025631 is a deficient number, since it is larger than the sum of its proper divisors (10386601).
135025631 is a wasteful number, since it uses less digits than its factorization.
135025631 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10386600.
The product of its (nonzero) digits is 2700, while the sum is 26.
The square root of 135025631 is about 11620.0529688982. The cubic root of 135025631 is about 513.0252474253.
The spelling of 135025631 in words is "one hundred thirty-five million, twenty-five thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •