Base | Representation |
---|---|
bin | 1001010111101110000101… |
… | …1010001101111011100101 |
3 | 1100110222010200102102202121 |
4 | 2111323201122031323211 |
5 | 2322301234002302323 |
6 | 33525103535305541 |
7 | 2112242516152045 |
oct | 225734132157345 |
9 | 40428120372677 |
10 | 10303113322213 |
11 | 3312586961388 |
12 | 11a498b97b2b1 |
13 | 59976bc97c0a |
14 | 27895d935725 |
15 | 12d01aacca5d |
hex | 95ee168dee5 |
10303113322213 has 2 divisors, whose sum is σ = 10303113322214. Its totient is φ = 10303113322212.
The previous prime is 10303113322211. The next prime is 10303113322219. The reversal of 10303113322213 is 31222331130301.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5169884492644 + 5133228829569 = 2273738^2 + 2265663^2 .
It is a cyclic number.
It is not a de Polignac number, because 10303113322213 - 21 = 10303113322211 is a prime.
Together with 10303113322211, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10303113322211) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5151556661106 + 5151556661107.
It is an arithmetic number, because the mean of its divisors is an integer number (5151556661107).
Almost surely, 210303113322213 is an apocalyptic number.
It is an amenable number.
10303113322213 is a deficient number, since it is larger than the sum of its proper divisors (1).
10303113322213 is an equidigital number, since it uses as much as digits as its factorization.
10303113322213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1944, while the sum is 25.
Adding to 10303113322213 its reverse (31222331130301), we get a palindrome (41525444452514).
The spelling of 10303113322213 in words is "ten trillion, three hundred three billion, one hundred thirteen million, three hundred twenty-two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •