Base | Representation |
---|---|
bin | 1011111100010100110010… |
… | …1110100100101001010101 |
3 | 1201111022102010102221102001 |
4 | 2333011030232210221111 |
5 | 3210114243042113023 |
6 | 43532144342315301 |
7 | 2523453322652212 |
oct | 277051456445125 |
9 | 51438363387361 |
10 | 13131002301013 |
11 | 4202910524473 |
12 | 1580a62128b31 |
13 | 74332c3c456c |
14 | 33578867ab09 |
15 | 17b87a4d36ad |
hex | bf14cba4a55 |
13131002301013 has 2 divisors, whose sum is σ = 13131002301014. Its totient is φ = 13131002301012.
The previous prime is 13131002300993. The next prime is 13131002301019. The reversal of 13131002301013 is 31010320013131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8501697198289 + 4629305102724 = 2915767^2 + 2151582^2 .
It is a cyclic number.
It is not a de Polignac number, because 13131002301013 - 25 = 13131002300981 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13131002301019) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6565501150506 + 6565501150507.
It is an arithmetic number, because the mean of its divisors is an integer number (6565501150507).
Almost surely, 213131002301013 is an apocalyptic number.
It is an amenable number.
13131002301013 is a deficient number, since it is larger than the sum of its proper divisors (1).
13131002301013 is an equidigital number, since it uses as much as digits as its factorization.
13131002301013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 13131002301013 its reverse (31010320013131), we get a palindrome (44141322314144).
The spelling of 13131002301013 in words is "thirteen trillion, one hundred thirty-one billion, two million, three hundred one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •