Base | Representation |
---|---|
bin | 1010011110010001111111… |
… | …1011100000100100110001 |
3 | 1111202212010001110021020212 |
4 | 2213210133323200210301 |
5 | 3002131410302423233 |
6 | 40254024152513505 |
7 | 2265645635422544 |
oct | 247443773404461 |
9 | 44685101407225 |
10 | 11515343014193 |
11 | 373a6a1a22027 |
12 | 135b9010ab895 |
13 | 656b7a199445 |
14 | 2bb4ba38c85b |
15 | 14e8192aaa48 |
hex | a791fee0931 |
11515343014193 has 2 divisors, whose sum is σ = 11515343014194. Its totient is φ = 11515343014192.
The previous prime is 11515343014171. The next prime is 11515343014229. The reversal of 11515343014193 is 39141034351511.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11481410426929 + 33932587264 = 3388423^2 + 184208^2 .
It is a cyclic number.
It is not a de Polignac number, because 11515343014193 - 26 = 11515343014129 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11515343014193.
It is not a weakly prime, because it can be changed into another prime (11515343014393) 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, 5757671507096 + 5757671507097.
It is an arithmetic number, because the mean of its divisors is an integer number (5757671507097).
Almost surely, 211515343014193 is an apocalyptic number.
It is an amenable number.
11515343014193 is a deficient number, since it is larger than the sum of its proper divisors (1).
11515343014193 is an equidigital number, since it uses as much as digits as its factorization.
11515343014193 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 97200, while the sum is 41.
The spelling of 11515343014193 in words is "eleven trillion, five hundred fifteen billion, three hundred forty-three million, fourteen thousand, one hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •