Base | Representation |
---|---|
bin | 100110110110110001101… |
… | …0011111010111101000001 |
3 | 200220112021102101111212122 |
4 | 1031231203103322331001 |
5 | 1144443423442444041 |
6 | 15205145455534025 |
7 | 1060552605262412 |
oct | 115554323727501 |
9 | 20815242344778 |
10 | 5340310515521 |
11 | 17798a40787a3 |
12 | 722ba322a315 |
13 | 2c97873b5607 |
14 | 146688405809 |
15 | 93da8ca1c4b |
hex | 4db634faf41 |
5340310515521 has 2 divisors, whose sum is σ = 5340310515522. Its totient is φ = 5340310515520.
The previous prime is 5340310515517. The next prime is 5340310515523. The reversal of 5340310515521 is 1255150130435.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4990148370496 + 350162145025 = 2233864^2 + 591745^2 .
It is a cyclic number.
It is not a de Polignac number, because 5340310515521 - 22 = 5340310515517 is a prime.
It is a Sophie Germain prime.
Together with 5340310515523, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (5340310515523) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2670155257760 + 2670155257761.
It is an arithmetic number, because the mean of its divisors is an integer number (2670155257761).
Almost surely, 25340310515521 is an apocalyptic number.
It is an amenable number.
5340310515521 is a deficient number, since it is larger than the sum of its proper divisors (1).
5340310515521 is an equidigital number, since it uses as much as digits as its factorization.
5340310515521 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 45000, while the sum is 35.
Adding to 5340310515521 its reverse (1255150130435), we get a palindrome (6595460645956).
The spelling of 5340310515521 in words is "five trillion, three hundred forty billion, three hundred ten million, five hundred fifteen thousand, five hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •