Base | Representation |
---|---|
bin | 1100000000011110100001… |
… | …0011110010011100110100 |
3 | 1201202010112012212012021001 |
4 | 3000013220103302130310 |
5 | 3212301333443031400 |
6 | 44025022333333044 |
7 | 2531560044264343 |
oct | 300075023623464 |
9 | 51663465765231 |
10 | 13202332002100 |
11 | 423009425a65a |
12 | 159284a337184 |
13 | 749c89175a97 |
14 | 338dd3b05b5a |
15 | 17d6526eea6a |
hex | c01e84f2734 |
13202332002100 has 18 divisors (see below), whose sum is σ = 28649060444774. Its totient is φ = 5280932800800.
The previous prime is 13202332002071. The next prime is 13202332002113. The reversal of 13202332002100 is 120023320231.
It can be written as a sum of positive squares in 3 ways, for example, as 4283484236964 + 8918847765136 = 2069658^2 + 2986444^2 .
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 5 ways as a sum of consecutive naturals, for example, 66011659911 + ... + 66011660110.
Almost surely, 213202332002100 is an apocalyptic number.
13202332002100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13202332002100 is an abundant number, since it is smaller than the sum of its proper divisors (15446728442674).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13202332002100 is a wasteful number, since it uses less digits than its factorization.
13202332002100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 132023320035 (or 132023320028 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 19.
Adding to 13202332002100 its reverse (120023320231), we get a palindrome (13322355322331).
The spelling of 13202332002100 in words is "thirteen trillion, two hundred two billion, three hundred thirty-two million, two thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •