Base | Representation |
---|---|
bin | 10100100000110110… |
… | …10011111011011101 |
3 | 1001102111221001000021 |
4 | 22100123103323131 |
5 | 140023312410323 |
6 | 5020451032141 |
7 | 536625032146 |
oct | 122033237335 |
9 | 31374831007 |
10 | 11013013213 |
11 | 4741616914 |
12 | 217429b651 |
13 | 1066832887 |
14 | 7668daacd |
15 | 446cb005d |
hex | 2906d3edd |
11013013213 has 2 divisors, whose sum is σ = 11013013214. Its totient is φ = 11013013212.
The previous prime is 11013013189. The next prime is 11013013247. The reversal of 11013013213 is 31231031011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10893723129 + 119290084 = 104373^2 + 10922^2 .
It is an emirp because it is prime and its reverse (31231031011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11013013213 - 221 = 11010916061 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11013053213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5506506606 + 5506506607.
It is an arithmetic number, because the mean of its divisors is an integer number (5506506607).
Almost surely, 211013013213 is an apocalyptic number.
It is an amenable number.
11013013213 is a deficient number, since it is larger than the sum of its proper divisors (1).
11013013213 is an equidigital number, since it uses as much as digits as its factorization.
11013013213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 54, while the sum is 16.
Adding to 11013013213 its reverse (31231031011), we get a palindrome (42244044224).
The spelling of 11013013213 in words is "eleven billion, thirteen million, thirteen thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •