Base | Representation |
---|---|
bin | 10000001001111… |
… | …01000110111001 |
3 | 100102222221211101 |
4 | 20010331012321 |
5 | 234143012401 |
6 | 21240331401 |
7 | 3233605063 |
oct | 1004750671 |
9 | 312887741 |
10 | 135516601 |
11 | 6a54a6a0 |
12 | 39473b61 |
13 | 220ca74c |
14 | 13dd8733 |
15 | bd6d101 |
hex | 813d1b9 |
135516601 has 16 divisors (see below), whose sum is σ = 151538688. Its totient is φ = 120140800.
The previous prime is 135516599. The next prime is 135516613. The reversal of 135516601 is 106615531.
It is a cyclic number.
It is not a de Polignac number, because 135516601 - 21 = 135516599 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 135516601.
It is not an unprimeable number, because it can be changed into a prime (135514601) 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 15 ways as a sum of consecutive naturals, for example, 110745 + ... + 111961.
It is an arithmetic number, because the mean of its divisors is an integer number (9471168).
Almost surely, 2135516601 is an apocalyptic number.
135516601 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
135516601 is a deficient number, since it is larger than the sum of its proper divisors (16022087).
135516601 is a wasteful number, since it uses less digits than its factorization.
135516601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1472.
The product of its (nonzero) digits is 2700, while the sum is 28.
The square root of 135516601 is about 11641.1597789911. The cubic root of 135516601 is about 513.6463031712.
It can be divided in two parts, 1355 and 16601, that added together give a square (17956 = 1342).
The spelling of 135516601 in words is "one hundred thirty-five million, five hundred sixteen thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •