Base | Representation |
---|---|
bin | 1100000000011010010110… |
… | …0111100110010111011100 |
3 | 1201202000122020111012022210 |
4 | 3000012211213212113130 |
5 | 3212242041024401022 |
6 | 44024315324040420 |
7 | 2531520240045306 |
oct | 300064547462734 |
9 | 51660566435283 |
10 | 13201213122012 |
11 | 422a66a71a473 |
12 | 1592597693110 |
13 | 749b3b414666 |
14 | 338d29290976 |
15 | 17d5d9389a0c |
hex | c01a59e65dc |
13201213122012 has 24 divisors (see below), whose sum is σ = 31037966733312. Its totient is φ = 4366813500400.
The previous prime is 13201213122007. The next prime is 13201213122029. The reversal of 13201213122012 is 21022131210231.
It is a self number, because there is not a number n which added to its sum of digits gives 13201213122012.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4198857564 + ... + 4198860707.
It is an arithmetic number, because the mean of its divisors is an integer number (1293248613888).
Almost surely, 213201213122012 is an apocalyptic number.
13201213122012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
13201213122012 is an abundant number, since it is smaller than the sum of its proper divisors (17836753611300).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13201213122012 is a wasteful number, since it uses less digits than its factorization.
13201213122012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8397718409 (or 8397718407 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 13201213122012 its reverse (21022131210231), we get a palindrome (34223344332243).
The spelling of 13201213122012 in words is "thirteen trillion, two hundred one billion, two hundred thirteen million, one hundred twenty-two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •