Base | Representation |
---|---|
bin | 11001001010101001… |
… | …00101111011111100 |
3 | 1021212121102211002000 |
4 | 30211110211323330 |
5 | 210132312312043 |
6 | 10112404502300 |
7 | 655550043111 |
oct | 144524457374 |
9 | 37777384060 |
10 | 13511057148 |
11 | 5803704236 |
12 | 27509aa990 |
13 | 1374228894 |
14 | 92259c908 |
15 | 5412512d3 |
hex | 325525efc |
13511057148 has 48 divisors (see below), whose sum is σ = 35100145920. Its totient is φ = 4494495600.
The previous prime is 13511057137. The next prime is 13511057191. The reversal of 13511057148 is 84175011531.
It is a happy number.
13511057148 is a `hidden beast` number, since 1 + 35 + 1 + 10 + 571 + 48 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 74368 + ... + 180423.
It is an arithmetic number, because the mean of its divisors is an integer number (731253040).
Almost surely, 213511057148 is an apocalyptic number.
13511057148 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
13511057148 is an abundant number, since it is smaller than the sum of its proper divisors (21589088772).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13511057148 is a wasteful number, since it uses less digits than its factorization.
13511057148 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 255295 (or 255287 counting only the distinct ones).
The product of its (nonzero) digits is 16800, while the sum is 36.
Adding to 13511057148 its reverse (84175011531), we get a palindrome (97686068679).
The spelling of 13511057148 in words is "thirteen billion, five hundred eleven million, fifty-seven thousand, one hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •