Base | Representation |
---|---|
bin | 1100000001100101001100… |
… | …0001011001010110111111 |
3 | 1201210221111021122201002212 |
4 | 3000121103001121112333 |
5 | 3213104211331241111 |
6 | 44041440555011035 |
7 | 2533131123355004 |
oct | 300312301312677 |
9 | 51727437581085 |
10 | 13221302212031 |
11 | 4238139469101 |
12 | 1596463439a7b |
13 | 74b9c03b2c84 |
14 | 339cb33278ab |
15 | 17ddb2d5298b |
hex | c06530595bf |
13221302212031 has 2 divisors, whose sum is σ = 13221302212032. Its totient is φ = 13221302212030.
The previous prime is 13221302211979. The next prime is 13221302212043. The reversal of 13221302212031 is 13021220312231.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13221302212031 is a prime.
It is a super-3 number, since 3×132213022120313 (a number of 40 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 13221302211988 and 13221302212006.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13221302212051) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6610651106015 + 6610651106016.
It is an arithmetic number, because the mean of its divisors is an integer number (6610651106016).
Almost surely, 213221302212031 is an apocalyptic number.
13221302212031 is a deficient number, since it is larger than the sum of its proper divisors (1).
13221302212031 is an equidigital number, since it uses as much as digits as its factorization.
13221302212031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 13221302212031 its reverse (13021220312231), we get a palindrome (26242522524262).
The spelling of 13221302212031 in words is "thirteen trillion, two hundred twenty-one billion, three hundred two million, two hundred twelve thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •