Base | Representation |
---|---|
bin | 1010011110010001111111… |
… | …1000000100110110011001 |
3 | 1111202212002222202112200211 |
4 | 2213210133320010312121 |
5 | 3002131410040123301 |
6 | 40254024121331121 |
7 | 2265645624653632 |
oct | 247443770046631 |
9 | 44685088675624 |
10 | 11515342114201 |
11 | 373a6a1467932 |
12 | 135b900936aa1 |
13 | 656b79c428c3 |
14 | 2bb4ba1d6889 |
15 | 14e81917e051 |
hex | a791fe04d99 |
11515342114201 has 2 divisors, whose sum is σ = 11515342114202. Its totient is φ = 11515342114200.
The previous prime is 11515342114193. The next prime is 11515342114247. The reversal of 11515342114201 is 10241124351511.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11491286414400 + 24055699801 = 3389880^2 + 155099^2 .
It is a cyclic number.
It is not a de Polignac number, because 11515342114201 - 23 = 11515342114193 is a prime.
It is not a weakly prime, because it can be changed into another prime (11515342114271) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5757671057100 + 5757671057101.
It is an arithmetic number, because the mean of its divisors is an integer number (5757671057101).
Almost surely, 211515342114201 is an apocalyptic number.
It is an amenable number.
11515342114201 is a deficient number, since it is larger than the sum of its proper divisors (1).
11515342114201 is an equidigital number, since it uses as much as digits as its factorization.
11515342114201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4800, while the sum is 31.
Adding to 11515342114201 its reverse (10241124351511), we get a palindrome (21756466465712).
The spelling of 11515342114201 in words is "eleven trillion, five hundred fifteen billion, three hundred forty-two million, one hundred fourteen thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •