Base | Representation |
---|---|
bin | 10000001101001… |
… | …00111101100001 |
3 | 100110210120100100 |
4 | 20012210331201 |
5 | 234300120420 |
6 | 21253413013 |
7 | 3240326214 |
oct | 1006447541 |
9 | 313716310 |
10 | 135941985 |
11 | 6a810253 |
12 | 3963a169 |
13 | 2221925a |
14 | 140a977b |
15 | be04190 |
hex | 81a4f61 |
135941985 has 24 divisors (see below), whose sum is σ = 236179944. Its totient is φ = 72334080.
The previous prime is 135941969. The next prime is 135941989. The reversal of 135941985 is 589149531.
It can be written as a sum of positive squares in 4 ways, for example, as 2954961 + 132987024 = 1719^2 + 11532^2 .
It is not a de Polignac number, because 135941985 - 24 = 135941969 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a self number, because there is not a number n which added to its sum of digits gives 135941985.
It is not an unprimeable number, because it can be changed into a prime (135941989) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 17469 + ... + 24021.
It is an arithmetic number, because the mean of its divisors is an integer number (9840831).
Almost surely, 2135941985 is an apocalyptic number.
135941985 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
135941985 is a deficient number, since it is larger than the sum of its proper divisors (100237959).
135941985 is a wasteful number, since it uses less digits than its factorization.
135941985 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7025 (or 7022 counting only the distinct ones).
The product of its digits is 194400, while the sum is 45.
The square root of 135941985 is about 11659.4161517633. The cubic root of 135941985 is about 514.1831837601.
The spelling of 135941985 in words is "one hundred thirty-five million, nine hundred forty-one thousand, nine hundred eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •