Base | Representation |
---|---|
bin | 11000110001101000… |
… | …00100000101100101 |
3 | 1021022222120010201022 |
4 | 30120310010011211 |
5 | 204220102001201 |
6 | 10035510540525 |
7 | 650421235241 |
oct | 143064040545 |
9 | 37288503638 |
10 | 13301203301 |
11 | 5706200a01 |
12 | 26b2667745 |
13 | 133c9013c9 |
14 | 902773421 |
15 | 52caec41b |
hex | 318d04165 |
13301203301 has 8 divisors (see below), whose sum is σ = 13930738944. Its totient is φ = 12675936240.
The previous prime is 13301203273. The next prime is 13301203337. The reversal of 13301203301 is 10330210331.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 13301203301 - 222 = 13297008997 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 13301203301.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13301203381) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1060766 + ... + 1073231.
It is an arithmetic number, because the mean of its divisors is an integer number (1741342368).
Almost surely, 213301203301 is an apocalyptic number.
It is an amenable number.
13301203301 is a deficient number, since it is larger than the sum of its proper divisors (629535643).
13301203301 is a wasteful number, since it uses less digits than its factorization.
13301203301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2134291.
The product of its (nonzero) digits is 162, while the sum is 17.
Adding to 13301203301 its reverse (10330210331), we get a palindrome (23631413632).
The spelling of 13301203301 in words is "thirteen billion, three hundred one million, two hundred three thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •