Base | Representation |
---|---|
bin | 10000000110000… |
… | …10001100101111 |
3 | 100102001101020200 |
4 | 20003002030233 |
5 | 234030410132 |
6 | 21221444543 |
7 | 3226410252 |
oct | 1003021457 |
9 | 312041220 |
10 | 135013167 |
11 | 6a236433 |
12 | 39270753 |
13 | 21c82563 |
14 | 13d07099 |
15 | bcbdd7c |
hex | 80c232f |
135013167 has 12 divisors (see below), whose sum is σ = 206490960. Its totient is φ = 84714048.
The previous prime is 135013159. The next prime is 135013169. The reversal of 135013167 is 761310531.
It is not a de Polignac number, because 135013167 - 23 = 135013159 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 135013167.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (135013169) 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 11 ways as a sum of consecutive naturals, for example, 441067 + ... + 441372.
It is an arithmetic number, because the mean of its divisors is an integer number (17207580).
Almost surely, 2135013167 is an apocalyptic number.
135013167 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
135013167 is a deficient number, since it is larger than the sum of its proper divisors (71477793).
135013167 is a wasteful number, since it uses less digits than its factorization.
135013167 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 882462 (or 882459 counting only the distinct ones).
The product of its (nonzero) digits is 1890, while the sum is 27.
The square root of 135013167 is about 11619.5166422705. The cubic root of 135013167 is about 513.0094614262.
Adding to 135013167 its reverse (761310531), we get a palindrome (896323698).
The spelling of 135013167 in words is "one hundred thirty-five million, thirteen thousand, one hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •