Base | Representation |
---|---|
bin | 1100000111010100110111… |
… | …1000000100110010011001 |
3 | 1202011101020201012102212121 |
4 | 3001311031320010302121 |
5 | 3221213330013131301 |
6 | 44155042405541241 |
7 | 2543224010002402 |
oct | 301651570046231 |
9 | 52141221172777 |
10 | 13320000130201 |
11 | 4275a86904916 |
12 | 15b1609114821 |
13 | 7580bc208c9b |
14 | 3409974849a9 |
15 | 18173cada3a1 |
hex | c1d4de04c99 |
13320000130201 has 4 divisors (see below), whose sum is σ = 13357733841972. Its totient is φ = 13282266418432.
The previous prime is 13320000130181. The next prime is 13320000130219. The reversal of 13320000130201 is 10203100002331.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 7582533249600 + 5737466880601 = 2753640^2 + 2395301^2 .
It is a cyclic number.
It is not a de Polignac number, because 13320000130201 - 223 = 13319991741593 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13320000130501) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 18866855356 + ... + 18866856061.
It is an arithmetic number, because the mean of its divisors is an integer number (3339433460493).
Almost surely, 213320000130201 is an apocalyptic number.
It is an amenable number.
13320000130201 is a deficient number, since it is larger than the sum of its proper divisors (37733711771).
13320000130201 is an equidigital number, since it uses as much as digits as its factorization.
13320000130201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 37733711770.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 13320000130201 its reverse (10203100002331), we get a palindrome (23523100132532).
The spelling of 13320000130201 in words is "thirteen trillion, three hundred twenty billion, one hundred thirty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •