Base | Representation |
---|---|
bin | 111110111010101000… |
… | …1100110010000100011 |
3 | 110220202011012001112012 |
4 | 1331311101212100203 |
5 | 4203202023033403 |
6 | 142022553023135 |
7 | 12522122041454 |
oct | 1756521462043 |
9 | 426664161465 |
10 | 135111533603 |
11 | 52333a35a72 |
12 | 222286b4aab |
13 | c982b84827 |
14 | 677a2c112b |
15 | 37ab99bed8 |
hex | 1f75466423 |
135111533603 has 4 divisors (see below), whose sum is σ = 135592357848. Its totient is φ = 134630709360.
The previous prime is 135111533597. The next prime is 135111533617. The reversal of 135111533603 is 306335111531.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 306335111531 = 17 ⋅18019712443.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-135111533603 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 135111533603.
It is not an unprimeable number, because it can be changed into a prime (135171533603) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 240411701 + ... + 240412262.
It is an arithmetic number, because the mean of its divisors is an integer number (33898089462).
Almost surely, 2135111533603 is an apocalyptic number.
135111533603 is a deficient number, since it is larger than the sum of its proper divisors (480824245).
135111533603 is an equidigital number, since it uses as much as digits as its factorization.
135111533603 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 480824244.
The product of its (nonzero) digits is 12150, while the sum is 32.
The spelling of 135111533603 in words is "one hundred thirty-five billion, one hundred eleven million, five hundred thirty-three thousand, six hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •