Base | Representation |
---|---|
bin | 11000001111101011000111… |
… | …10011100111101000111101 |
3 | 20222202212121020021221121101 |
4 | 30013311203303213220331 |
5 | 23442003313000140331 |
6 | 305220342002533101 |
7 | 14141613652416514 |
oct | 1407654363475075 |
9 | 228685536257541 |
10 | 53315103521341 |
11 | 15a9589901a202 |
12 | 5b909a8367191 |
13 | 23997921a504c |
14 | d246714d367b |
15 | 626cac9c5061 |
hex | 307d63ce7a3d |
53315103521341 has 16 divisors (see below), whose sum is σ = 53690267473920. Its totient is φ = 52940958900480.
The previous prime is 53315103521333. The next prime is 53315103521357. The reversal of 53315103521341 is 14312530151335.
It is a cyclic number.
It is not a de Polignac number, because 53315103521341 - 23 = 53315103521333 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 53315103521341.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (53315103522341) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1452353095 + ... + 1452389803.
It is an arithmetic number, because the mean of its divisors is an integer number (3355641717120).
Almost surely, 253315103521341 is an apocalyptic number.
It is an amenable number.
53315103521341 is a deficient number, since it is larger than the sum of its proper divisors (375163952579).
53315103521341 is a wasteful number, since it uses less digits than its factorization.
53315103521341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50316.
The product of its (nonzero) digits is 81000, while the sum is 37.
Adding to 53315103521341 its reverse (14312530151335), we get a palindrome (67627633672676).
The spelling of 53315103521341 in words is "fifty-three trillion, three hundred fifteen billion, one hundred three million, five hundred twenty-one thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •