Base | Representation |
---|---|
bin | 1011111011001110000000… |
… | …1010110010100010010011 |
3 | 1201102111100220100112112122 |
4 | 2332303200022302202103 |
5 | 3204311334241042321 |
6 | 43515323053044455 |
7 | 2522211416345261 |
oct | 276634012624223 |
9 | 51374326315478 |
10 | 13112001112211 |
11 | 41a584a887051 |
12 | 157923a78672b |
13 | 7415c192b991 |
14 | 3348a4cb3431 |
15 | 17b1172b18ab |
hex | bece02b2893 |
13112001112211 has 2 divisors, whose sum is σ = 13112001112212. Its totient is φ = 13112001112210.
The previous prime is 13112001112201. The next prime is 13112001112237. The reversal of 13112001112211 is 11221110021131.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13112001112211 is a prime.
It is a Sophie Germain prime.
It is a self number, because there is not a number n which added to its sum of digits gives 13112001112211.
It is not a weakly prime, because it can be changed into another prime (13112001112201) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6556000556105 + 6556000556106.
It is an arithmetic number, because the mean of its divisors is an integer number (6556000556106).
Almost surely, 213112001112211 is an apocalyptic number.
13112001112211 is a deficient number, since it is larger than the sum of its proper divisors (1).
13112001112211 is an equidigital number, since it uses as much as digits as its factorization.
13112001112211 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24, while the sum is 17.
Adding to 13112001112211 its reverse (11221110021131), we get a palindrome (24333111133342).
The spelling of 13112001112211 in words is "thirteen trillion, one hundred twelve billion, one million, one hundred twelve thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •