Base | Representation |
---|---|
bin | 1100000000011001101011… |
… | …1101001110001111101001 |
3 | 1201202000011202220002201011 |
4 | 3000012122331032033221 |
5 | 3212241204231203001 |
6 | 44024245454023521 |
7 | 2531512635430315 |
oct | 300063275161751 |
9 | 51660152802634 |
10 | 13201034241001 |
11 | 422a588751522 |
12 | 15925477a7ba1 |
13 | 749b10342bc9 |
14 | 338d0d608b45 |
15 | 17d5c8802d51 |
hex | c019af4e3e9 |
13201034241001 has 2 divisors, whose sum is σ = 13201034241002. Its totient is φ = 13201034241000.
The previous prime is 13201034240993. The next prime is 13201034241011. The reversal of 13201034241001 is 10014243010231.
13201034241001 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11529963536400 + 1671070704601 = 3395580^2 + 1292699^2 .
It is a cyclic number.
It is not a de Polignac number, because 13201034241001 - 23 = 13201034240993 is a prime.
It is not a weakly prime, because it can be changed into another prime (13201034241011) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6600517120500 + 6600517120501.
It is an arithmetic number, because the mean of its divisors is an integer number (6600517120501).
Almost surely, 213201034241001 is an apocalyptic number.
It is an amenable number.
13201034241001 is a deficient number, since it is larger than the sum of its proper divisors (1).
13201034241001 is an equidigital number, since it uses as much as digits as its factorization.
13201034241001 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 13201034241001 its reverse (10014243010231), we get a palindrome (23215277251232).
The spelling of 13201034241001 in words is "thirteen trillion, two hundred one billion, thirty-four million, two hundred forty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.158 sec. • engine limits •