Base | Representation |
---|---|
bin | 100101011011111101111… |
… | …1110001101100111110101 |
3 | 200012212221000210200021011 |
4 | 1022313323332031213311 |
5 | 1133300040112241003 |
6 | 14535415241152221 |
7 | 1040510260644055 |
oct | 112677376154765 |
9 | 20185830720234 |
10 | 5145303243253 |
11 | 17041245a7868 |
12 | 6b123b78b671 |
13 | 2b427a579c04 |
14 | 13b069451565 |
15 | 8dc93ce946d |
hex | 4adfbf8d9f5 |
5145303243253 has 2 divisors, whose sum is σ = 5145303243254. Its totient is φ = 5145303243252.
The previous prime is 5145303243247. The next prime is 5145303243307. The reversal of 5145303243253 is 3523423035415.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4423479684849 + 721823558404 = 2103207^2 + 849602^2 .
It is a cyclic number.
It is not a de Polignac number, because 5145303243253 - 225 = 5145269688821 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5145303246253) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2572651621626 + 2572651621627.
It is an arithmetic number, because the mean of its divisors is an integer number (2572651621627).
Almost surely, 25145303243253 is an apocalyptic number.
It is an amenable number.
5145303243253 is a deficient number, since it is larger than the sum of its proper divisors (1).
5145303243253 is an equidigital number, since it uses as much as digits as its factorization.
5145303243253 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 648000, while the sum is 40.
Adding to 5145303243253 its reverse (3523423035415), we get a palindrome (8668726278668).
The spelling of 5145303243253 in words is "five trillion, one hundred forty-five billion, three hundred three million, two hundred forty-three thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •