Base | Representation |
---|---|
bin | 100100100100111000010… |
… | …010010111000001010101 |
3 | 22220021210011002001010102 |
4 | 210210320102113001111 |
5 | 312140122023031031 |
6 | 5202404104303445 |
7 | 346410610142162 |
oct | 44447022270125 |
9 | 8807704061112 |
10 | 2513500205141 |
11 | 889a73380212 |
12 | 347172171b85 |
13 | 1530395ab3c3 |
14 | 89922a49069 |
15 | 455ade1b7cb |
hex | 24938497055 |
2513500205141 has 2 divisors, whose sum is σ = 2513500205142. Its totient is φ = 2513500205140.
The previous prime is 2513500205137. The next prime is 2513500205213. The reversal of 2513500205141 is 1415020053152.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1400781134116 + 1112719071025 = 1183546^2 + 1054855^2 .
It is a cyclic number.
It is not a de Polignac number, because 2513500205141 - 22 = 2513500205137 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2513500205441) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1256750102570 + 1256750102571.
It is an arithmetic number, because the mean of its divisors is an integer number (1256750102571).
Almost surely, 22513500205141 is an apocalyptic number.
It is an amenable number.
2513500205141 is a deficient number, since it is larger than the sum of its proper divisors (1).
2513500205141 is an equidigital number, since it uses as much as digits as its factorization.
2513500205141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6000, while the sum is 29.
Adding to 2513500205141 its reverse (1415020053152), we get a palindrome (3928520258293).
The spelling of 2513500205141 in words is "two trillion, five hundred thirteen billion, five hundred million, two hundred five thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •