Base | Representation |
---|---|
bin | 100101010101000110001… |
… | …0100100100010100011101 |
3 | 200011110211111212000210022 |
4 | 1022222030110210110131 |
5 | 1133024324024401214 |
6 | 14524535004121525 |
7 | 1036445456153552 |
oct | 112521424442435 |
9 | 20143744760708 |
10 | 5130545153309 |
11 | 16a8940a93414 |
12 | 6aa4012362a5 |
13 | 2b2a67ba0204 |
14 | 13a4693dca29 |
15 | 8d6cd36bd8e |
hex | 4aa8c52451d |
5130545153309 has 2 divisors, whose sum is σ = 5130545153310. Its totient is φ = 5130545153308.
The previous prime is 5130545153249. The next prime is 5130545153389. The reversal of 5130545153309 is 9033515450315.
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., 5052505937284 + 78039216025 = 2247778^2 + 279355^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5130545153309 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 5130545153309.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5130545153389) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2565272576654 + 2565272576655.
It is an arithmetic number, because the mean of its divisors is an integer number (2565272576655).
Almost surely, 25130545153309 is an apocalyptic number.
It is an amenable number.
5130545153309 is a deficient number, since it is larger than the sum of its proper divisors (1).
5130545153309 is an equidigital number, since it uses as much as digits as its factorization.
5130545153309 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 607500, while the sum is 44.
The spelling of 5130545153309 in words is "five trillion, one hundred thirty billion, five hundred forty-five million, one hundred fifty-three thousand, three hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •