Base | Representation |
---|---|
bin | 10111110111111101000101… |
… | …00110000000011100111001 |
3 | 20212212221222011002111100101 |
4 | 23323332202212000130321 |
5 | 23340130212430200241 |
6 | 303354115150235401 |
7 | 14026002513411502 |
oct | 1373764246003471 |
9 | 225787864074311 |
10 | 52500113131321 |
11 | 1580119a207629 |
12 | 5a7aa597b5b61 |
13 | 233a97c69580b |
14 | cd703a329ba9 |
15 | 6109ad66ae31 |
hex | 2fbfa2980739 |
52500113131321 has 8 divisors (see below), whose sum is σ = 52507297569888. Its totient is φ = 52492929060000.
The previous prime is 52500113131313. The next prime is 52500113131357. The reversal of 52500113131321 is 12313131100525.
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 52500113131321 - 23 = 52500113131313 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 52500113131321.
It is not an unprimeable number, because it can be changed into a prime (52500113131391) 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, 396667126 + ... + 396799456.
It is an arithmetic number, because the mean of its divisors is an integer number (6563412196236).
Almost surely, 252500113131321 is an apocalyptic number.
It is an amenable number.
52500113131321 is a deficient number, since it is larger than the sum of its proper divisors (7184438567).
52500113131321 is a wasteful number, since it uses less digits than its factorization.
52500113131321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 183623.
The product of its (nonzero) digits is 2700, while the sum is 28.
Adding to 52500113131321 its reverse (12313131100525), we get a palindrome (64813244231846).
The spelling of 52500113131321 in words is "fifty-two trillion, five hundred billion, one hundred thirteen million, one hundred thirty-one thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •