Base | Representation |
---|---|
bin | 100110101000111001101… |
… | …0001000001110011100101 |
3 | 200210200100210220022020022 |
4 | 1031101303101001303211 |
5 | 1144001412413442131 |
6 | 15143341032444525 |
7 | 1055446321203326 |
oct | 115216321016345 |
9 | 20720323808208 |
10 | 5310513421541 |
11 | 17681a3421a99 |
12 | 719268249745 |
13 | 2c6a19084463 |
14 | 14505ccd844d |
15 | 93212da837b |
hex | 4d473441ce5 |
5310513421541 has 4 divisors (see below), whose sum is σ = 5311148430912. Its totient is φ = 5309878412172.
The previous prime is 5310513421457. The next prime is 5310513421553. The reversal of 5310513421541 is 1451243150135.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 5310513421541 - 230 = 5309439679717 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5310513421571) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 317492141 + ... + 317508866.
It is an arithmetic number, because the mean of its divisors is an integer number (1327787107728).
Almost surely, 25310513421541 is an apocalyptic number.
It is an amenable number.
5310513421541 is a deficient number, since it is larger than the sum of its proper divisors (635009371).
5310513421541 is an equidigital number, since it uses as much as digits as its factorization.
5310513421541 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 635009370.
The product of its (nonzero) digits is 36000, while the sum is 35.
Adding to 5310513421541 its reverse (1451243150135), we get a palindrome (6761756571676).
The spelling of 5310513421541 in words is "five trillion, three hundred ten billion, five hundred thirteen million, four hundred twenty-one thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •