Base | Representation |
---|---|
bin | 1011110110100001000111… |
… | …1001010011110101111101 |
3 | 1201010202212220011022221211 |
4 | 2331220101321103311331 |
5 | 3202000430114342341 |
6 | 43414244225324421 |
7 | 2513322024001222 |
oct | 275502171236575 |
9 | 51122786138854 |
10 | 13031231012221 |
11 | 41745722014a4 |
12 | 1565658a96711 |
13 | 736abc0b25c6 |
14 | 330a01b53949 |
15 | 178e8b3c5181 |
hex | bda11e53d7d |
13031231012221 has 2 divisors, whose sum is σ = 13031231012222. Its totient is φ = 13031231012220.
The previous prime is 13031231012171. The next prime is 13031231012249. The reversal of 13031231012221 is 12221013213031.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11550176088025 + 1481054924196 = 3398555^2 + 1216986^2 .
It is a cyclic number.
It is not a de Polignac number, because 13031231012221 - 29 = 13031231011709 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13031231012192 and 13031231012201.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13031231012521) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6515615506110 + 6515615506111.
It is an arithmetic number, because the mean of its divisors is an integer number (6515615506111).
Almost surely, 213031231012221 is an apocalyptic number.
It is an amenable number.
13031231012221 is a deficient number, since it is larger than the sum of its proper divisors (1).
13031231012221 is an equidigital number, since it uses as much as digits as its factorization.
13031231012221 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 13031231012221 its reverse (12221013213031), we get a palindrome (25252244225252).
The spelling of 13031231012221 in words is "thirteen trillion, thirty-one billion, two hundred thirty-one million, twelve thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •