Base | Representation |
---|---|
bin | 11000110001101000… |
… | …01010110110101101 |
3 | 1021022222121112201222 |
4 | 30120310022312231 |
5 | 204220103343041 |
6 | 10035511313125 |
7 | 650421412121 |
oct | 143064126655 |
9 | 37288545658 |
10 | 13301231021 |
11 | 570621a811 |
12 | 26b267b7a5 |
13 | 133c910c00 |
14 | 90277d581 |
15 | 52cb0574b |
hex | 318d0adad |
13301231021 has 24 divisors (see below), whose sum is σ = 14584215744. Its totient is φ = 12124270080.
The previous prime is 13301231011. The next prime is 13301231051. The reversal of 13301231021 is 12013210331.
13301231021 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a de Polignac number, because none of the positive numbers 2k-13301231021 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13301231011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 12900776 + ... + 12901806.
It is an arithmetic number, because the mean of its divisors is an integer number (607675656).
Almost surely, 213301231021 is an apocalyptic number.
It is an amenable number.
13301231021 is a deficient number, since it is larger than the sum of its proper divisors (1282984723).
13301231021 is a wasteful number, since it uses less digits than its factorization.
13301231021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1941 (or 1928 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 13301231021 its reverse (12013210331), we get a palindrome (25314441352).
The spelling of 13301231021 in words is "thirteen billion, three hundred one million, two hundred thirty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •