Base | Representation |
---|---|
bin | 1011011000100101111110… |
… | …0000111000101001011101 |
3 | 1122022121220210212120120102 |
4 | 2312021133200320221131 |
5 | 3120040044103003301 |
6 | 42342143214030445 |
7 | 2431222220222012 |
oct | 266113740705135 |
9 | 48277823776512 |
10 | 12517137156701 |
11 | 3a96540670821 |
12 | 14a1aa3aa8425 |
13 | 6ca490083b68 |
14 | 313b92bc5709 |
15 | 16a8ed2beb6b |
hex | b625f838a5d |
12517137156701 has 2 divisors, whose sum is σ = 12517137156702. Its totient is φ = 12517137156700.
The previous prime is 12517137156653. The next prime is 12517137156703. The reversal of 12517137156701 is 10765173171521.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11151391996900 + 1365745159801 = 3339370^2 + 1168651^2 .
It is a cyclic number.
It is not a de Polignac number, because 12517137156701 - 214 = 12517137140317 is a prime.
Together with 12517137156703, 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 (12517137156703) 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, 6258568578350 + 6258568578351.
It is an arithmetic number, because the mean of its divisors is an integer number (6258568578351).
Almost surely, 212517137156701 is an apocalyptic number.
It is an amenable number.
12517137156701 is a deficient number, since it is larger than the sum of its proper divisors (1).
12517137156701 is an equidigital number, since it uses as much as digits as its factorization.
12517137156701 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 308700, while the sum is 47.
The spelling of 12517137156701 in words is "twelve trillion, five hundred seventeen billion, one hundred thirty-seven million, one hundred fifty-six thousand, seven hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •