Base | Representation |
---|---|
bin | 10000000101111111… |
… | …11110100000100111 |
3 | 211022011011200200122 |
4 | 20002333332200213 |
5 | 120143401311020 |
6 | 3545210432155 |
7 | 424053666533 |
oct | 100277764047 |
9 | 24264150618 |
10 | 8640260135 |
11 | 3734224361 |
12 | 181173265b |
13 | a79096a80 |
14 | 5bd730bc3 |
15 | 35881c125 |
hex | 202ffe827 |
8640260135 has 8 divisors (see below), whose sum is σ = 11165874720. Its totient is φ = 6380499744.
The previous prime is 8640260131. The next prime is 8640260137. The reversal of 8640260135 is 5310620468.
8640260135 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
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 8640260135 - 22 = 8640260131 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 8640260095 and 8640260104.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (8640260131) 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, 66463475 + ... + 66463604.
It is an arithmetic number, because the mean of its divisors is an integer number (1395734340).
Almost surely, 28640260135 is an apocalyptic number.
8640260135 is a deficient number, since it is larger than the sum of its proper divisors (2525614585).
8640260135 is a wasteful number, since it uses less digits than its factorization.
8640260135 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 132927097.
The product of its (nonzero) digits is 34560, while the sum is 35.
The square root of 8640260135 is about 92952.9996019494. Note that the first 3 decimals coincide. The cubic root of 8640260135 is about 2051.9917295365.
The spelling of 8640260135 in words is "eight billion, six hundred forty million, two hundred sixty thousand, one hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •