Base | Representation |
---|---|
bin | 1010001011111111011001… |
… | …0011101111101111111001 |
3 | 1110122211000202120111211122 |
4 | 2202333312103233233321 |
5 | 2432004334200041441 |
6 | 35453415254035025 |
7 | 2234153000010611 |
oct | 242776623575771 |
9 | 43584022514748 |
10 | 11201112112121 |
11 | 3629401858438 |
12 | 130aa25948a75 |
13 | 63334cc74c29 |
14 | 2aa1cb229a41 |
15 | 1465775a834b |
hex | a2ff64efbf9 |
11201112112121 has 2 divisors, whose sum is σ = 11201112112122. Its totient is φ = 11201112112120.
The previous prime is 11201112112111. The next prime is 11201112112129. The reversal of 11201112112121 is 12121121110211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10862225132521 + 338886979600 = 3295789^2 + 582140^2 .
It is a cyclic number.
It is not a de Polignac number, because 11201112112121 - 214 = 11201112095737 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11201112112121.
It is not a weakly prime, because it can be changed into another prime (11201112112129) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5600556056060 + 5600556056061.
It is an arithmetic number, because the mean of its divisors is an integer number (5600556056061).
Almost surely, 211201112112121 is an apocalyptic number.
It is an amenable number.
11201112112121 is a deficient number, since it is larger than the sum of its proper divisors (1).
11201112112121 is an equidigital number, since it uses as much as digits as its factorization.
11201112112121 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 16, while the sum is 17.
Adding to 11201112112121 its reverse (12121121110211), we get a palindrome (23322233222332).
The spelling of 11201112112121 in words is "eleven trillion, two hundred one billion, one hundred twelve million, one hundred twelve thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •