Base | Representation |
---|---|
bin | 10000000110111… |
… | …00010010111101 |
3 | 100102020210212201 |
4 | 20003130102331 |
5 | 234042320221 |
6 | 21224031501 |
7 | 3230334016 |
oct | 1003342275 |
9 | 312223781 |
10 | 135120061 |
11 | 6a2a977a |
12 | 39302591 |
13 | 21cbc0cb |
14 | 13d3400d |
15 | bce0891 |
hex | 80dc4bd |
135120061 has 8 divisors (see below), whose sum is σ = 138663360. Its totient is φ = 131595072.
The previous prime is 135120059. The next prime is 135120071. The reversal of 135120061 is 160021531.
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 135120061 - 21 = 135120059 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 (135120031) 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 7 ways as a sum of consecutive naturals, for example, 11061 + ... + 19813.
It is an arithmetic number, because the mean of its divisors is an integer number (17332920).
Almost surely, 2135120061 is an apocalyptic number.
It is an amenable number.
135120061 is a deficient number, since it is larger than the sum of its proper divisors (3543299).
135120061 is an equidigital number, since it uses as much as digits as its factorization.
135120061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9155.
The product of its (nonzero) digits is 180, while the sum is 19.
The square root of 135120061 is about 11624.1154932322. The cubic root of 135120061 is about 513.1448140706.
Adding to 135120061 its reverse (160021531), we get a palindrome (295141592).
It can be divided in two parts, 1351 and 20061, that added together give a palindrome (21412).
The spelling of 135120061 in words is "one hundred thirty-five million, one hundred twenty thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •