Base | Representation |
---|---|
bin | 10111101010100100100100… |
… | …11111100011101110000001 |
3 | 20211021000001200202120101020 |
4 | 23311102102133203232001 |
5 | 23310111444031122031 |
6 | 302402550354500053 |
7 | 13650533455155213 |
oct | 1365222237435601 |
9 | 224230050676336 |
10 | 52040281504641 |
11 | 15644183249581 |
12 | 5a05908b94629 |
13 | 23064ba4600a1 |
14 | cbca97bc25b3 |
15 | 603a491cd096 |
hex | 2f54927e3b81 |
52040281504641 has 8 divisors (see below), whose sum is σ = 69406225609824. Its totient is φ = 34683929201280.
The previous prime is 52040281504583. The next prime is 52040281504663. The reversal of 52040281504641 is 14640518204025.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 52040281504641 - 234 = 52023101635457 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 52040281504593 and 52040281504602.
It is not an unprimeable number, because it can be changed into a prime (52040281504741) 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, 2397937795 + ... + 2397959496.
It is an arithmetic number, because the mean of its divisors is an integer number (8675778201228).
Almost surely, 252040281504641 is an apocalyptic number.
It is an amenable number.
52040281504641 is a deficient number, since it is larger than the sum of its proper divisors (17365944105183).
52040281504641 is a wasteful number, since it uses less digits than its factorization.
52040281504641 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4795900911.
The product of its (nonzero) digits is 307200, while the sum is 42.
Adding to 52040281504641 its reverse (14640518204025), we get a palindrome (66680799708666).
The spelling of 52040281504641 in words is "fifty-two trillion, forty billion, two hundred eighty-one million, five hundred four thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •