Base | Representation |
---|---|
bin | 10000001001111… |
… | …00110001000101 |
3 | 100102222212220200 |
4 | 20010330301011 |
5 | 234142441310 |
6 | 21240321113 |
7 | 3233601030 |
oct | 1004746105 |
9 | 312885820 |
10 | 135515205 |
11 | 6a549641 |
12 | 39473199 |
13 | 220c9c17 |
14 | 13dd8017 |
15 | bd6c9c0 |
hex | 813cc45 |
135515205 has 48 divisors (see below), whose sum is σ = 272498304. Its totient is φ = 61015680.
The previous prime is 135515189. The next prime is 135515207. The reversal of 135515205 is 502515531.
135515205 is a `hidden beast` number, since 135 + 5 + 1 + 520 + 5 = 666.
It is not a de Polignac number, because 135515205 - 24 = 135515189 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (135515207) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 17895 + ... + 24315.
It is an arithmetic number, because the mean of its divisors is an integer number (5677048).
Almost surely, 2135515205 is an apocalyptic number.
135515205 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
135515205 is an abundant number, since it is smaller than the sum of its proper divisors (136983099).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
135515205 is a wasteful number, since it uses less digits than its factorization.
135515205 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6506 (or 6503 counting only the distinct ones).
The product of its (nonzero) digits is 3750, while the sum is 27.
The square root of 135515205 is about 11641.0998191752. The cubic root of 135515205 is about 513.6445394200.
The spelling of 135515205 in words is "one hundred thirty-five million, five hundred fifteen thousand, two hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •