Base | Representation |
---|---|
bin | 1100000111010100111010… |
… | …0001100111100000001101 |
3 | 1202011101021110200201021122 |
4 | 3001311032201213200031 |
5 | 3221213340310122201 |
6 | 44155043435210325 |
7 | 2543224201400066 |
oct | 301651641474015 |
9 | 52141243621248 |
10 | 13320011020301 |
11 | 4275a91a727a7 |
12 | 15b16108a69a5 |
13 | 7580c154ca2b |
14 | 340998abb56d |
15 | 18173da3be1b |
hex | c1d4e86780d |
13320011020301 has 2 divisors, whose sum is σ = 13320011020302. Its totient is φ = 13320011020300.
The previous prime is 13320011020297. The next prime is 13320011020313. The reversal of 13320011020301 is 10302011002331.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7990238543401 + 5329772476900 = 2826701^2 + 2308630^2 .
It is a cyclic number.
It is not a de Polignac number, because 13320011020301 - 22 = 13320011020297 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 13320011020301.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13320011920301) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6660005510150 + 6660005510151.
It is an arithmetic number, because the mean of its divisors is an integer number (6660005510151).
Almost surely, 213320011020301 is an apocalyptic number.
It is an amenable number.
13320011020301 is a deficient number, since it is larger than the sum of its proper divisors (1).
13320011020301 is an equidigital number, since it uses as much as digits as its factorization.
13320011020301 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 13320011020301 its reverse (10302011002331), we get a palindrome (23622022022632).
The spelling of 13320011020301 in words is "thirteen trillion, three hundred twenty billion, eleven million, twenty thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •