Base | Representation |
---|---|
bin | 11101100101001111111011… |
… | …111001000100101000000111 |
3 | 122001122201210100222102222112 |
4 | 131211033323321010220013 |
5 | 114023102102040434021 |
6 | 1140412310252451235 |
7 | 36255431421535163 |
oct | 3545177371045007 |
9 | 561581710872875 |
10 | 130103080405511 |
11 | 38500452121604 |
12 | 12712a22479b1b |
13 | 577988b31bc85 |
14 | 241b046395ca3 |
15 | 100942de5ad5b |
hex | 7653fbe44a07 |
130103080405511 has 2 divisors, whose sum is σ = 130103080405512. Its totient is φ = 130103080405510.
The previous prime is 130103080405489. The next prime is 130103080405513. The reversal of 130103080405511 is 115504080301031.
It is a strong prime.
It is an emirp because it is prime and its reverse (115504080301031) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-130103080405511 is a prime.
It is a super-2 number, since 2×1301030804055112 (a number of 29 digits) contains 22 as substring.
Together with 130103080405513, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (130103080405513) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65051540202755 + 65051540202756.
It is an arithmetic number, because the mean of its divisors is an integer number (65051540202756).
Almost surely, 2130103080405511 is an apocalyptic number.
130103080405511 is a deficient number, since it is larger than the sum of its proper divisors (1).
130103080405511 is an equidigital number, since it uses as much as digits as its factorization.
130103080405511 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 7200, while the sum is 32.
The spelling of 130103080405511 in words is "one hundred thirty trillion, one hundred three billion, eighty million, four hundred five thousand, five hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •