Base | Representation |
---|---|
bin | 1010011110001001010010… |
… | …1001000101000110010111 |
3 | 1111202122002012020021021122 |
4 | 2213202110221011012113 |
5 | 3002112114033300124 |
6 | 40253000233434155 |
7 | 2265534011413532 |
oct | 247422451050627 |
9 | 44678065207248 |
10 | 11513006150039 |
11 | 3739702912439 |
12 | 135b36a56b95b |
13 | 656896cb7ba4 |
14 | 2bb337c85a19 |
15 | 14e72e05675e |
hex | a7894a45197 |
11513006150039 has 2 divisors, whose sum is σ = 11513006150040. Its totient is φ = 11513006150038.
The previous prime is 11513006149969. The next prime is 11513006150057. The reversal of 11513006150039 is 93005160031511.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 11513006150039 - 28 = 11513006149783 is a prime.
It is a super-2 number, since 2×115130061500392 (a number of 27 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 11513006149990 and 11513006150008.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11513006150089) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5756503075019 + 5756503075020.
It is an arithmetic number, because the mean of its divisors is an integer number (5756503075020).
Almost surely, 211513006150039 is an apocalyptic number.
11513006150039 is a deficient number, since it is larger than the sum of its proper divisors (1).
11513006150039 is an equidigital number, since it uses as much as digits as its factorization.
11513006150039 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 12150, while the sum is 35.
The spelling of 11513006150039 in words is "eleven trillion, five hundred thirteen billion, six million, one hundred fifty thousand, thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •