Base | Representation |
---|---|
bin | 10000000111000… |
… | …10110110010111 |
3 | 100102022011200212 |
4 | 20003202312113 |
5 | 234044200103 |
6 | 21224400035 |
7 | 3230505203 |
oct | 1003426627 |
9 | 312264625 |
10 | 135146903 |
11 | 6a317961 |
12 | 3931601b |
13 | 21ccb3a8 |
14 | 13d3db03 |
15 | bce87d8 |
hex | 80e2d97 |
135146903 has 8 divisors (see below), whose sum is σ = 141077280. Its totient is φ = 129336480.
The previous prime is 135146897. The next prime is 135146909. The reversal of 135146903 is 309641531.
It is an interprime number because it is at equal distance from previous prime (135146897) and next prime (135146909).
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 135146903 - 28 = 135146647 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 135146903.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (135146909) 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, 27683 + ... + 32196.
It is an arithmetic number, because the mean of its divisors is an integer number (17634660).
Almost surely, 2135146903 is an apocalyptic number.
135146903 is a deficient number, since it is larger than the sum of its proper divisors (5930377).
135146903 is an equidigital number, since it uses as much as digits as its factorization.
135146903 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 59977.
The product of its (nonzero) digits is 9720, while the sum is 32.
The square root of 135146903 is about 11625.2700183695. The cubic root of 135146903 is about 513.1787910661.
The spelling of 135146903 in words is "one hundred thirty-five million, one hundred forty-six thousand, nine hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •