Base | Representation |
---|---|
bin | 110001011001011010… |
… | …100101010010100101 |
3 | 12001220102122101022210 |
4 | 301121122211102211 |
5 | 1332111133421021 |
6 | 40211025514033 |
7 | 3555242264403 |
oct | 613132452245 |
9 | 161812571283 |
10 | 53039748261 |
11 | 205486119a5 |
12 | a342aa2919 |
13 | 5003760336 |
14 | 27d2322473 |
15 | 15a668ae76 |
hex | c596a54a5 |
53039748261 has 32 divisors (see below), whose sum is σ = 71785986048. Its totient is φ = 34831713600.
The previous prime is 53039748259. The next prime is 53039748271. The reversal of 53039748261 is 16284793035.
It is not a de Polignac number, because 53039748261 - 21 = 53039748259 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 53039748261.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (53039748221) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 58477770 + ... + 58478676.
It is an arithmetic number, because the mean of its divisors is an integer number (2243312064).
It is a 1-persistent number, because it is pandigital, but 2⋅53039748261 = 106079496522 is not.
Almost surely, 253039748261 is an apocalyptic number.
It is an amenable number.
53039748261 is a deficient number, since it is larger than the sum of its proper divisors (18746237787).
53039748261 is a wasteful number, since it uses less digits than its factorization.
53039748261 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2001.
The product of its (nonzero) digits is 1088640, while the sum is 48.
The spelling of 53039748261 in words is "fifty-three billion, thirty-nine million, seven hundred forty-eight thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.235 sec. • engine limits •