Base | Representation |
---|---|
bin | 1100000111100001001111… |
… | …0001100110000011001001 |
3 | 1202011200211002201120022121 |
4 | 3001320103301212003021 |
5 | 3221242130000221301 |
6 | 44200352053051241 |
7 | 2543402204104543 |
oct | 301702361460311 |
9 | 52150732646277 |
10 | 13323320320201 |
11 | 427742aa897a1 |
12 | 15b2195026b21 |
13 | 7584cb03a058 |
14 | 340bd03d8693 |
15 | 18188432a3a1 |
hex | c1e13c660c9 |
13323320320201 has 8 divisors (see below), whose sum is σ = 13384032296544. Its totient is φ = 13262668908000.
The previous prime is 13323320320147. The next prime is 13323320320361. The reversal of 13323320320201 is 10202302332331.
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 13323320320201 - 233 = 13314730385609 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13323320390201) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 14700031 + ... + 15580036.
It is an arithmetic number, because the mean of its divisors is an integer number (1673004037068).
Almost surely, 213323320320201 is an apocalyptic number.
It is an amenable number.
13323320320201 is a deficient number, since it is larger than the sum of its proper divisors (60711976343).
13323320320201 is a wasteful number, since it uses less digits than its factorization.
13323320320201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30282071.
The product of its (nonzero) digits is 3888, while the sum is 25.
Adding to 13323320320201 its reverse (10202302332331), we get a palindrome (23525622652532).
The spelling of 13323320320201 in words is "thirteen trillion, three hundred twenty-three billion, three hundred twenty million, three hundred twenty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •