Base | Representation |
---|---|
bin | 111110111010011010… |
… | …1011001111100101001 |
3 | 110220201122021120201112 |
4 | 1331310311121330221 |
5 | 4203143130040040 |
6 | 142022130400105 |
7 | 12522002161106 |
oct | 1756465317451 |
9 | 426648246645 |
10 | 135104143145 |
11 | 5232a848454 |
12 | 22226130035 |
13 | c98149798a |
14 | 6779319aad |
15 | 37aaedc365 |
hex | 1f74d59f29 |
135104143145 has 8 divisors (see below), whose sum is σ = 162155610504. Its totient is φ = 108062888704.
The previous prime is 135104143121. The next prime is 135104143157. The reversal of 135104143145 is 541341401531.
It can be written as a sum of positive squares in 4 ways, for example, as 36325310464 + 98778832681 = 190592^2 + 314291^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-135104143145 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2524094 + ... + 2577063.
It is an arithmetic number, because the mean of its divisors is an integer number (20269451313).
Almost surely, 2135104143145 is an apocalyptic number.
It is an amenable number.
135104143145 is a deficient number, since it is larger than the sum of its proper divisors (27051467359).
135104143145 is an equidigital number, since it uses as much as digits as its factorization.
135104143145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5106459.
The product of its (nonzero) digits is 14400, while the sum is 32.
Adding to 135104143145 its reverse (541341401531), we get a palindrome (676445544676).
The spelling of 135104143145 in words is "one hundred thirty-five billion, one hundred four million, one hundred forty-three thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •