Base | Representation |
---|---|
bin | 1100000000010111111011… |
… | …0010000011111011100101 |
3 | 1201201221221211110001211210 |
4 | 3000011332302003323211 |
5 | 3212234222224200000 |
6 | 44024130530422033 |
7 | 2531465135565462 |
oct | 300057662037345 |
9 | 51657854401753 |
10 | 13200561553125 |
11 | 422a36594a091 |
12 | 1592435431919 |
13 | 749a6643153b |
14 | 338ca6922669 |
15 | 17d59c082350 |
hex | c017ec83ee5 |
13200561553125 has 48 divisors (see below), whose sum is σ = 22007425809600. Its totient is φ = 7037772000000.
The previous prime is 13200561553111. The next prime is 13200561553129. The reversal of 13200561553125 is 52135516500231.
13200561553125 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 13200561553125 - 26 = 13200561553061 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13200561553129) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 26008026 + ... + 26510724.
It is an arithmetic number, because the mean of its divisors is an integer number (458488037700).
Almost surely, 213200561553125 is an apocalyptic number.
13200561553125 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
13200561553125 is a deficient number, since it is larger than the sum of its proper divisors (8806864256475).
13200561553125 is an frugal number, since it uses more digits than its factorization.
13200561553125 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 505528 (or 505508 counting only the distinct ones).
The product of its (nonzero) digits is 135000, while the sum is 39.
The spelling of 13200561553125 in words is "thirteen trillion, two hundred billion, five hundred sixty-one million, five hundred fifty-three thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •