Base | Representation |
---|---|
bin | 1001000110101111000011… |
… | …0001011110011011100101 |
3 | 1022110001221122012111112201 |
4 | 2101223300301132123211 |
5 | 2303011132201114341 |
6 | 33143044524214501 |
7 | 2052202450665631 |
oct | 221536061363345 |
9 | 38401848174481 |
10 | 10011313301221 |
11 | 320a857400741 |
12 | 115831469a431 |
13 | 5780a7c59cbb |
14 | 26879b875dc1 |
15 | 12563d26c331 |
hex | 91af0c5e6e5 |
10011313301221 has 2 divisors, whose sum is σ = 10011313301222. Its totient is φ = 10011313301220.
The previous prime is 10011313301207. The next prime is 10011313301233. The reversal of 10011313301221 is 12210331311001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5694833368225 + 4316479932996 = 2386385^2 + 2077614^2 .
It is a cyclic number.
It is not a de Polignac number, because 10011313301221 - 229 = 10010776430309 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10011313301261) 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, 5005656650610 + 5005656650611.
It is an arithmetic number, because the mean of its divisors is an integer number (5005656650611).
Almost surely, 210011313301221 is an apocalyptic number.
It is an amenable number.
10011313301221 is a deficient number, since it is larger than the sum of its proper divisors (1).
10011313301221 is an equidigital number, since it uses as much as digits as its factorization.
10011313301221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 10011313301221 its reverse (12210331311001), we get a palindrome (22221644612222).
The spelling of 10011313301221 in words is "ten trillion, eleven billion, three hundred thirteen million, three hundred one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •