Base | Representation |
---|---|
bin | 1010001100101001001001… |
… | …1110001100100110001101 |
3 | 1110200212222000000110000212 |
4 | 2203022102132030212031 |
5 | 2432200313420011023 |
6 | 35502511501332205 |
7 | 2235030535525034 |
oct | 243122236144615 |
9 | 43625860013025 |
10 | 11212322032013 |
11 | 3633134534143 |
12 | 1311033b67065 |
13 | 63441851ab1b |
14 | 2aa971d4171b |
15 | 1469d17b0e78 |
hex | a329278c98d |
11212322032013 has 2 divisors, whose sum is σ = 11212322032014. Its totient is φ = 11212322032012.
The previous prime is 11212322031997. The next prime is 11212322032019. The reversal of 11212322032013 is 31023022321211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9501424023844 + 1710898008169 = 3082438^2 + 1308013^2 .
It is a cyclic number.
It is not a de Polignac number, because 11212322032013 - 24 = 11212322031997 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11212322032013.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11212322032019) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5606161016006 + 5606161016007.
It is an arithmetic number, because the mean of its divisors is an integer number (5606161016007).
Almost surely, 211212322032013 is an apocalyptic number.
It is an amenable number.
11212322032013 is a deficient number, since it is larger than the sum of its proper divisors (1).
11212322032013 is an equidigital number, since it uses as much as digits as its factorization.
11212322032013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 11212322032013 its reverse (31023022321211), we get a palindrome (42235344353224).
The spelling of 11212322032013 in words is "eleven trillion, two hundred twelve billion, three hundred twenty-two million, thirty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •