Base | Representation |
---|---|
bin | 1001001101101101101101… |
… | …0111101011110110110101 |
3 | 1022212112102200012200120112 |
4 | 2103123123113223312311 |
5 | 2311442211101200341 |
6 | 33314114245312405 |
7 | 2063645624124653 |
oct | 223333327536665 |
9 | 38775380180515 |
10 | 10131213303221 |
11 | 325669487588a |
12 | 11775b6a05705 |
13 | 5864a550174a |
14 | 2704d37cbdd3 |
15 | 12880956daeb |
hex | 936db5ebdb5 |
10131213303221 has 2 divisors, whose sum is σ = 10131213303222. Its totient is φ = 10131213303220.
The previous prime is 10131213303217. The next prime is 10131213303269. The reversal of 10131213303221 is 12230331213101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9362284246225 + 768929056996 = 3059785^2 + 876886^2 .
It is an emirp because it is prime and its reverse (12230331213101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10131213303221 - 22 = 10131213303217 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10131213303521) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5065606651610 + 5065606651611.
It is an arithmetic number, because the mean of its divisors is an integer number (5065606651611).
Almost surely, 210131213303221 is an apocalyptic number.
It is an amenable number.
10131213303221 is a deficient number, since it is larger than the sum of its proper divisors (1).
10131213303221 is an equidigital number, since it uses as much as digits as its factorization.
10131213303221 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 10131213303221 its reverse (12230331213101), we get a palindrome (22361544516322).
The spelling of 10131213303221 in words is "ten trillion, one hundred thirty-one billion, two hundred thirteen million, three hundred three thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.125 sec. • engine limits •