Base | Representation |
---|---|
bin | 1011110110100001000100… |
… | …1111010011100110110001 |
3 | 1201010202212010102220200021 |
4 | 2331220101033103212301 |
5 | 3202000414310014301 |
6 | 43414243153323441 |
7 | 2513321531261143 |
oct | 275502117234661 |
9 | 51122763386607 |
10 | 13031220001201 |
11 | 4174566a70786 |
12 | 1565655266581 |
13 | 736ab9a287cc |
14 | 330a004c8c93 |
15 | 178e8a44c8a1 |
hex | bda113d39b1 |
13031220001201 has 2 divisors, whose sum is σ = 13031220001202. Its totient is φ = 13031220001200.
The previous prime is 13031220001199. The next prime is 13031220001271. The reversal of 13031220001201 is 10210002213031.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 12197241927025 + 833978074176 = 3492455^2 + 913224^2 .
It is a cyclic number.
It is not a de Polignac number, because 13031220001201 - 21 = 13031220001199 is a prime.
Together with 13031220001199, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (13031220001271) 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, 6515610000600 + 6515610000601.
It is an arithmetic number, because the mean of its divisors is an integer number (6515610000601).
Almost surely, 213031220001201 is an apocalyptic number.
It is an amenable number.
13031220001201 is a deficient number, since it is larger than the sum of its proper divisors (1).
13031220001201 is an equidigital number, since it uses as much as digits as its factorization.
13031220001201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 13031220001201 its reverse (10210002213031), we get a palindrome (23241222214232).
The spelling of 13031220001201 in words is "thirteen trillion, thirty-one billion, two hundred twenty million, one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •