Base | Representation |
---|---|
bin | 1010000000111000001100… |
… | …1100010011110110111101 |
3 | 1102222120020220221020212222 |
4 | 2200032003030103312331 |
5 | 2420342343232101023 |
6 | 35230003404335125 |
7 | 2214314034505661 |
oct | 240160314236675 |
9 | 42876226836788 |
10 | 11010202222013 |
11 | 3565445134355 |
12 | 1299a265444a5 |
13 | 61b346c96007 |
14 | 2a0c7a4d88a1 |
15 | 1416021aecc8 |
hex | a0383313dbd |
11010202222013 has 2 divisors, whose sum is σ = 11010202222014. Its totient is φ = 11010202222012.
The previous prime is 11010202222007. The next prime is 11010202222067. The reversal of 11010202222013 is 31022220201011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10319912101444 + 690290120569 = 3212462^2 + 830837^2 .
It is a cyclic number.
It is not a de Polignac number, because 11010202222013 - 210 = 11010202220989 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11010202221982 and 11010202222000.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11010202222213) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5505101111006 + 5505101111007.
It is an arithmetic number, because the mean of its divisors is an integer number (5505101111007).
Almost surely, 211010202222013 is an apocalyptic number.
It is an amenable number.
11010202222013 is a deficient number, since it is larger than the sum of its proper divisors (1).
11010202222013 is an equidigital number, since it uses as much as digits as its factorization.
11010202222013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 11010202222013 its reverse (31022220201011), we get a palindrome (42032422423024).
The spelling of 11010202222013 in words is "eleven trillion, ten billion, two hundred two million, two hundred twenty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •