Base | Representation |
---|---|
bin | 100101011011111100011… |
… | …1011101100001000011101 |
3 | 200012212210110211221212101 |
4 | 1022313320323230020131 |
5 | 1133244434034001031 |
6 | 14535410220205101 |
7 | 1040506101342103 |
oct | 112677073541035 |
9 | 20185713757771 |
10 | 5145252250141 |
11 | 17040a88389a3 |
12 | 6b1226699791 |
13 | 2b426cb34783 |
14 | 13b062779c73 |
15 | 8dc8e5c5361 |
hex | 4adf8eec21d |
5145252250141 has 2 divisors, whose sum is σ = 5145252250142. Its totient is φ = 5145252250140.
The previous prime is 5145252250109. The next prime is 5145252250153. The reversal of 5145252250141 is 1410522525415.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4936795172100 + 208457078041 = 2221890^2 + 456571^2 .
It is a cyclic number.
It is not a de Polignac number, because 5145252250141 - 25 = 5145252250109 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 5145252250141.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5145252250181) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2572626125070 + 2572626125071.
It is an arithmetic number, because the mean of its divisors is an integer number (2572626125071).
Almost surely, 25145252250141 is an apocalyptic number.
It is an amenable number.
5145252250141 is a deficient number, since it is larger than the sum of its proper divisors (1).
5145252250141 is an equidigital number, since it uses as much as digits as its factorization.
5145252250141 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 80000, while the sum is 37.
Adding to 5145252250141 its reverse (1410522525415), we get a palindrome (6555774775556).
The spelling of 5145252250141 in words is "five trillion, one hundred forty-five billion, two hundred fifty-two million, two hundred fifty thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •