Base | Representation |
---|---|
bin | 10111110101100000000111… |
… | …00010110010101110101001 |
3 | 20212120220110000221202120010 |
4 | 23322300003202302232221 |
5 | 23332240120111121323 |
6 | 303251300555522133 |
7 | 14016630246425214 |
oct | 1372600342625651 |
9 | 225526400852503 |
10 | 52415840332713 |
11 | 15779484431730 |
12 | 5a6665aa59349 |
13 | 2332a3c276700 |
14 | cd2d23d0877b |
15 | 60d6c9edcc93 |
hex | 2fac038b2ba9 |
52415840332713 has 24 divisors (see below), whose sum is σ = 82557063211680. Its totient is φ = 29323547036160.
The previous prime is 52415840332679. The next prime is 52415840332733. The reversal of 52415840332713 is 31723304851425.
52415840332713 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 52415840332713 - 29 = 52415840332201 is a prime.
It is not an unprimeable number, because it can be changed into a prime (52415840332733) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 4699280808 + ... + 4699291961.
It is an arithmetic number, because the mean of its divisors is an integer number (3439877633820).
Almost surely, 252415840332713 is an apocalyptic number.
It is an amenable number.
52415840332713 is a deficient number, since it is larger than the sum of its proper divisors (30141222878967).
52415840332713 is a wasteful number, since it uses less digits than its factorization.
52415840332713 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9398572809 (or 9398572796 counting only the distinct ones).
The product of its (nonzero) digits is 2419200, while the sum is 48.
The spelling of 52415840332713 in words is "fifty-two trillion, four hundred fifteen billion, eight hundred forty million, three hundred thirty-two thousand, seven hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •