Base | Representation |
---|---|
bin | 11000101011111110… |
… | …00010010010010100 |
3 | 1021012200021011002101 |
4 | 30111333002102110 |
5 | 204120424412420 |
6 | 10031053451444 |
7 | 646303666213 |
oct | 142577022224 |
9 | 37180234071 |
10 | 13253747860 |
11 | 5691438a31 |
12 | 269a7a0b84 |
13 | 1332b27272 |
14 | 8da33d07a |
15 | 52887660a |
hex | 315fc2494 |
13253747860 has 12 divisors (see below), whose sum is σ = 27832870548. Its totient is φ = 5301499136.
The previous prime is 13253747851. The next prime is 13253747867. The reversal of 13253747860 is 6874735231.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 9130566916 + 4123180944 = 95554^2 + 64212^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 13253747860.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13253747867) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 331343677 + ... + 331343716.
It is an arithmetic number, because the mean of its divisors is an integer number (2319405879).
Almost surely, 213253747860 is an apocalyptic number.
13253747860 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13253747860 is an abundant number, since it is smaller than the sum of its proper divisors (14579122688).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13253747860 is a wasteful number, since it uses less digits than its factorization.
13253747860 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 662687402 (or 662687400 counting only the distinct ones).
The product of its (nonzero) digits is 846720, while the sum is 46.
The spelling of 13253747860 in words is "thirteen billion, two hundred fifty-three million, seven hundred forty-seven thousand, eight hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •