Base | Representation |
---|---|
bin | 10000001001111… |
… | …00111110001001 |
3 | 100102222221001122 |
4 | 20010330332021 |
5 | 234143003131 |
6 | 21240325025 |
7 | 3233603333 |
oct | 1004747611 |
9 | 312887048 |
10 | 135516041 |
11 | 6a54a231 |
12 | 39473775 |
13 | 220ca40b |
14 | 13dd8453 |
15 | bd6cd7b |
hex | 813cf89 |
135516041 has 4 divisors (see below), whose sum is σ = 136715412. Its totient is φ = 134316672.
The previous prime is 135516019. The next prime is 135516053. The reversal of 135516041 is 140615531.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 29116816 + 106399225 = 5396^2 + 10315^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-135516041 is a prime.
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 135516041.
It is not an unprimeable number, because it can be changed into a prime (135516011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 599516 + ... + 599741.
It is an arithmetic number, because the mean of its divisors is an integer number (34178853).
Almost surely, 2135516041 is an apocalyptic number.
It is an amenable number.
135516041 is a deficient number, since it is larger than the sum of its proper divisors (1199371).
135516041 is a wasteful number, since it uses less digits than its factorization.
135516041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1199370.
The product of its (nonzero) digits is 1800, while the sum is 26.
The square root of 135516041 is about 11641.1357263800. The cubic root of 135516041 is about 513.6455956506.
The spelling of 135516041 in words is "one hundred thirty-five million, five hundred sixteen thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •