Base | Representation |
---|---|
bin | 100101001000010101001… |
… | …0100010101001011000001 |
3 | 200001212001222111212021012 |
4 | 1022100222110111023001 |
5 | 1132102203031322241 |
6 | 14504202430210305 |
7 | 1034455226551253 |
oct | 112205224251301 |
9 | 20055058455235 |
10 | 5103131120321 |
11 | 169825352a703 |
12 | 6a5030353995 |
13 | 2b02b94a6910 |
14 | 138dc85c1cd3 |
15 | 8cb267a06eb |
hex | 4a42a5152c1 |
5103131120321 has 8 divisors (see below), whose sum is σ = 5496627116904. Its totient is φ = 4709770473600.
The previous prime is 5103131120291. The next prime is 5103131120327. The reversal of 5103131120321 is 1230211313015.
It can be written as a sum of positive squares in 4 ways, for example, as 1962310680625 + 3140820439696 = 1400825^2 + 1772236^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 5103131120321 - 210 = 5103131119297 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5103131120327) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 33759146 + ... + 33909971.
It is an arithmetic number, because the mean of its divisors is an integer number (687078389613).
Almost surely, 25103131120321 is an apocalyptic number.
It is an amenable number.
5103131120321 is a deficient number, since it is larger than the sum of its proper divisors (393495996583).
5103131120321 is a wasteful number, since it uses less digits than its factorization.
5103131120321 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 67674931.
The product of its (nonzero) digits is 540, while the sum is 23.
Adding to 5103131120321 its reverse (1230211313015), we get a palindrome (6333342433336).
The spelling of 5103131120321 in words is "five trillion, one hundred three billion, one hundred thirty-one million, one hundred twenty thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •