Base | Representation |
---|---|
bin | 111111000110101011… |
… | …1101001010110111100 |
3 | 110221210022211111211120 |
4 | 1332031113221112330 |
5 | 4210014014203343 |
6 | 142131033150540 |
7 | 12535131026205 |
oct | 1761527512674 |
9 | 427708744746 |
10 | 135515772348 |
11 | 52521136580 |
12 | 2231bb5b450 |
13 | ca1884b558 |
14 | 67b7c6a5ac |
15 | 37d21eb683 |
hex | 1f8d5e95bc |
135515772348 has 48 divisors (see below), whose sum is σ = 344972355840. Its totient is φ = 41062633600.
The previous prime is 135515772347. The next prime is 135515772407. The reversal of 135515772348 is 843277515531.
It is a super-2 number, since 2×1355157723482 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 135515772348.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (135515772341) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 2864833 + ... + 2911751.
It is an arithmetic number, because the mean of its divisors is an integer number (7186924080).
Almost surely, 2135515772348 is an apocalyptic number.
It is an amenable number.
135515772348 is an abundant number, since it is smaller than the sum of its proper divisors (209456583492).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
135515772348 is a wasteful number, since it uses less digits than its factorization.
135515772348 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 68818 (or 68816 counting only the distinct ones).
The product of its digits is 3528000, while the sum is 51.
The spelling of 135515772348 in words is "one hundred thirty-five billion, five hundred fifteen million, seven hundred seventy-two thousand, three hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •