Base | Representation |
---|---|
bin | 11000010100100011… |
… | …00110010111100000 |
3 | 1020200222120221100020 |
4 | 30022101212113200 |
5 | 203220131201043 |
6 | 5555354553440 |
7 | 641400054006 |
oct | 141221462740 |
9 | 36628527306 |
10 | 13057287648 |
11 | 55a0553519 |
12 | 2644a38880 |
13 | 130120c212 |
14 | 8bc1dca76 |
15 | 5164bae83 |
hex | 30a4665e0 |
13057287648 has 48 divisors (see below), whose sum is σ = 36291583440. Its totient is φ = 4096403456.
The previous prime is 13057287643. The next prime is 13057287667. The reversal of 13057287648 is 84678275031.
It is a tau number, because it is divible by the number of its divisors (48).
It is a super-2 number, since 2×130572876482 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (51).
It is a self number, because there is not a number n which added to its sum of digits gives 13057287648.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13057287641) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3998763 + ... + 4002026.
It is an arithmetic number, because the mean of its divisors is an integer number (756074655).
Almost surely, 213057287648 is an apocalyptic number.
It is an amenable number.
13057287648 is an abundant number, since it is smaller than the sum of its proper divisors (23234295792).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13057287648 is a wasteful number, since it uses less digits than its factorization.
13057287648 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8000819 (or 8000811 counting only the distinct ones).
The product of its (nonzero) digits is 2257920, while the sum is 51.
The spelling of 13057287648 in words is "thirteen billion, fifty-seven million, two hundred eighty-seven thousand, six hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •