Base | Representation |
---|---|
bin | 1100000001000110101001… |
… | …0100101001111100110100 |
3 | 1201210011022212202211220101 |
4 | 3000101222110221330310 |
5 | 3212440413404431400 |
6 | 44034003225443444 |
7 | 2532421005052654 |
oct | 300215224517464 |
9 | 51704285684811 |
10 | 13213103202100 |
11 | 423471132463a |
12 | 1594955640584 |
13 | 74acb48713c9 |
14 | 339736458364 |
15 | 17da8314656a |
hex | c046a529f34 |
13213103202100 has 36 divisors (see below), whose sum is σ = 29076271062048. Its totient is φ = 5210801260000.
The previous prime is 13213103202067. The next prime is 13213103202119. The reversal of 13213103202100 is 120230131231.
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 11 ways as a sum of consecutive naturals, for example, 930493126 + ... + 930507325.
It is an arithmetic number, because the mean of its divisors is an integer number (807674196168).
Almost surely, 213213103202100 is an apocalyptic number.
13213103202100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13213103202100 is an abundant number, since it is smaller than the sum of its proper divisors (15863167859948).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13213103202100 is a wasteful number, since it uses less digits than its factorization.
13213103202100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1861000536 (or 1861000529 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 13213103202100 its reverse (120230131231), we get a palindrome (13333333333331).
The spelling of 13213103202100 in words is "thirteen trillion, two hundred thirteen billion, one hundred three million, two hundred two thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •