Base | Representation |
---|---|
bin | 111001011011000110111110… |
… | …0101010110111111010011110 |
3 | 2110020102101110121222021112110 |
4 | 1302312031330222313322132 |
5 | 1012201102202403302332 |
6 | 4550133101431214450 |
7 | 211251332304630426 |
oct | 16266157452677236 |
9 | 2406371417867473 |
10 | 505103130525342 |
11 | 136a3a042196458 |
12 | 48798454517426 |
13 | 188ac0369bc83b |
14 | 8ca319c925486 |
15 | 3d5dd590d24cc |
hex | 1cb637cab7e9e |
505103130525342 has 16 divisors (see below), whose sum is σ = 1010227958945280. Its totient is φ = 168364093859352.
The previous prime is 505103130525319. The next prime is 505103130525407. The reversal of 505103130525342 is 243525031301505.
It is a self number, because there is not a number n which added to its sum of digits gives 505103130525342.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 903776308 + ... + 904335015.
It is an arithmetic number, because the mean of its divisors is an integer number (63139247434080).
Almost surely, 2505103130525342 is an apocalyptic number.
505103130525342 is an abundant number, since it is smaller than the sum of its proper divisors (505124828419938).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
505103130525342 is a wasteful number, since it uses less digits than its factorization.
505103130525342 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1808157887.
The product of its (nonzero) digits is 270000, while the sum is 39.
Adding to 505103130525342 its reverse (243525031301505), we get a palindrome (748628161826847).
The spelling of 505103130525342 in words is "five hundred five trillion, one hundred three billion, one hundred thirty million, five hundred twenty-five thousand, three hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •