Base | Representation |
---|---|
bin | 10111110101101111100100… |
… | …10000011110000101110111 |
3 | 20212121200212110201022201001 |
4 | 23322313302100132011313 |
5 | 23332404114401022021 |
6 | 303255152331544131 |
7 | 14020343031526210 |
oct | 1372676220360567 |
9 | 225550773638631 |
10 | 52424140251511 |
11 | 15781a53528556 |
12 | 5a681965bb047 |
13 | 2333762989672 |
14 | cd34b0364407 |
15 | 60da139cd091 |
hex | 2fadf241e177 |
52424140251511 has 16 divisors (see below), whose sum is σ = 59938641564480. Its totient is φ = 44915976023040.
The previous prime is 52424140251493. The next prime is 52424140251517. The reversal of 52424140251511 is 11515204142425.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 52424140251511 - 211 = 52424140249463 is a prime.
It is a super-3 number, since 3×524241402515113 (a number of 42 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (52424140251517) 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, 275558841 + ... + 275749021.
It is an arithmetic number, because the mean of its divisors is an integer number (3746165097780).
Almost surely, 252424140251511 is an apocalyptic number.
52424140251511 is a deficient number, since it is larger than the sum of its proper divisors (7514501312969).
52424140251511 is a wasteful number, since it uses less digits than its factorization.
52424140251511 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 206634.
The product of its (nonzero) digits is 64000, while the sum is 37.
Adding to 52424140251511 its reverse (11515204142425), we get a palindrome (63939344393936).
The spelling of 52424140251511 in words is "fifty-two trillion, four hundred twenty-four billion, one hundred forty million, two hundred fifty-one thousand, five hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.122 sec. • engine limits •