Base | Representation |
---|---|
bin | 11101010001001100000… |
… | …101100110010000001101 |
3 | 21010021120102201221101211 |
4 | 131101030011212100031 |
5 | 230423141213332344 |
6 | 4135553242134421 |
7 | 265212262242364 |
oct | 35211405462015 |
9 | 7107512657354 |
10 | 2011321230349 |
11 | 705aa6443802 |
12 | 2859834b1411 |
13 | 117888bb0c42 |
14 | 6d4c429c7db |
15 | 374bbd71334 |
hex | 1d44c16640d |
2011321230349 has 2 divisors, whose sum is σ = 2011321230350. Its totient is φ = 2011321230348.
The previous prime is 2011321230323. The next prime is 2011321230379. The reversal of 2011321230349 is 9430321231102.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1997821114249 + 13500116100 = 1413443^2 + 116190^2 .
It is a cyclic number.
It is not a de Polignac number, because 2011321230349 - 219 = 2011320706061 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2011321230349.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2011321230379) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1005660615174 + 1005660615175.
It is an arithmetic number, because the mean of its divisors is an integer number (1005660615175).
Almost surely, 22011321230349 is an apocalyptic number.
It is an amenable number.
2011321230349 is a deficient number, since it is larger than the sum of its proper divisors (1).
2011321230349 is an equidigital number, since it uses as much as digits as its factorization.
2011321230349 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7776, while the sum is 31.
The spelling of 2011321230349 in words is "two trillion, eleven billion, three hundred twenty-one million, two hundred thirty thousand, three hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •