Base | Representation |
---|---|
bin | 1100000000011001011010… |
… | …0011101110100000111100 |
3 | 1201201222222122001001112020 |
4 | 3000012112203232200330 |
5 | 3212241031333323242 |
6 | 44024234300240140 |
7 | 2531511051260121 |
oct | 300062643564074 |
9 | 51658878031466 |
10 | 13200960448572 |
11 | 422a550030146 |
12 | 1592526b40050 |
13 | 749acac77150 |
14 | 338d038ba748 |
15 | 17d5c20c86ec |
hex | c01968ee83c |
13200960448572 has 24 divisors (see below), whose sum is σ = 33171644204496. Its totient is φ = 4061833984128.
The previous prime is 13200960448549. The next prime is 13200960448583. The reversal of 13200960448572 is 27584406900231.
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 7 ways as a sum of consecutive naturals, for example, 42310770513 + ... + 42310770824.
It is an arithmetic number, because the mean of its divisors is an integer number (1382151841854).
It is a 1-persistent number, because it is pandigital, but 2⋅13200960448572 = 26401920897144 is not.
Almost surely, 213200960448572 is an apocalyptic number.
13200960448572 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
13200960448572 is an abundant number, since it is smaller than the sum of its proper divisors (19970683755924).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13200960448572 is a wasteful number, since it uses less digits than its factorization.
13200960448572 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 84621541357 (or 84621541355 counting only the distinct ones).
The product of its (nonzero) digits is 2903040, while the sum is 51.
The spelling of 13200960448572 in words is "thirteen trillion, two hundred billion, nine hundred sixty million, four hundred forty-eight thousand, five hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •