Base | Representation |
---|---|
bin | 1100000110010010010011… |
… | …0111010111100101011100 |
3 | 1202002200010110120001021210 |
4 | 3001210210313113211130 |
5 | 3220420231321210022 |
6 | 44142525402224420 |
7 | 2542022144122542 |
oct | 301444467274534 |
9 | 52080113501253 |
10 | 13302132210012 |
11 | 4269447934a28 |
12 | 15aa0611b5110 |
13 | 756502471a49 |
14 | 33db803d9d92 |
15 | 181044121a0c |
hex | c1924dd795c |
13302132210012 has 48 divisors (see below), whose sum is σ = 31662177547392. Its totient is φ = 4345122250560.
The previous prime is 13302132209983. The next prime is 13302132210043. The reversal of 13302132210012 is 21001223120331.
13302132210012 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 12119314 + ... + 13171257.
It is an arithmetic number, because the mean of its divisors is an integer number (659628698904).
Almost surely, 213302132210012 is an apocalyptic number.
13302132210012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
13302132210012 is an abundant number, since it is smaller than the sum of its proper divisors (18360045337380).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13302132210012 is a wasteful number, since it uses less digits than its factorization.
13302132210012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 25291458 (or 25291456 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 13302132210012 its reverse (21001223120331), we get a palindrome (34303355330343).
The spelling of 13302132210012 in words is "thirteen trillion, three hundred two billion, one hundred thirty-two million, two hundred ten thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •