Base | Representation |
---|---|
bin | 100101011011000010101… |
… | …0110111010101010100101 |
3 | 200012200210100020112222011 |
4 | 1022312011112322222211 |
5 | 1133232001141334001 |
6 | 14534445552234221 |
7 | 1040410045056445 |
oct | 112660526725245 |
9 | 20180710215864 |
10 | 5143313230501 |
11 | 17032a3261826 |
12 | 6b098523b971 |
13 | 2b40211bb684 |
14 | 13ad1b036125 |
15 | 8dbc925ad51 |
hex | 4ad855baaa5 |
5143313230501 has 2 divisors, whose sum is σ = 5143313230502. Its totient is φ = 5143313230500.
The previous prime is 5143313230483. The next prime is 5143313230529. The reversal of 5143313230501 is 1050323133415.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4644891350401 + 498421880100 = 2155201^2 + 705990^2 .
It is a cyclic number.
It is not a de Polignac number, because 5143313230501 - 27 = 5143313230373 is a prime.
It is a super-2 number, since 2×51433132305012 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5143313230541) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2571656615250 + 2571656615251.
It is an arithmetic number, because the mean of its divisors is an integer number (2571656615251).
Almost surely, 25143313230501 is an apocalyptic number.
It is an amenable number.
5143313230501 is a deficient number, since it is larger than the sum of its proper divisors (1).
5143313230501 is an equidigital number, since it uses as much as digits as its factorization.
5143313230501 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 16200, while the sum is 31.
Adding to 5143313230501 its reverse (1050323133415), we get a palindrome (6193636363916).
The spelling of 5143313230501 in words is "five trillion, one hundred forty-three billion, three hundred thirteen million, two hundred thirty thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •