Base | Representation |
---|---|
bin | 10111101010000011001001… |
… | …10001101101000111110111 |
3 | 20211012021201221120102020012 |
4 | 23311001210301231013313 |
5 | 23304313220132000011 |
6 | 302350421451130435 |
7 | 13646326643301425 |
oct | 1365014461550767 |
9 | 224167657512205 |
10 | 52022334640631 |
11 | 15637603759a63 |
12 | 5a0233a743a1b |
13 | 23048ba245424 |
14 | cbbc74468115 |
15 | 60334881da8b |
hex | 2f5064c6d1f7 |
52022334640631 has 4 divisors (see below), whose sum is σ = 52027013340000. Its totient is φ = 52017655941264.
The previous prime is 52022334640579. The next prime is 52022334640637. The reversal of 52022334640631 is 13604643322025.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 52022334640631 - 210 = 52022334639607 is a prime.
It is a super-2 number, since 2×520223346406312 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (52022334640637) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2339333006 + ... + 2339355243.
It is an arithmetic number, because the mean of its divisors is an integer number (13006753335000).
Almost surely, 252022334640631 is an apocalyptic number.
52022334640631 is a deficient number, since it is larger than the sum of its proper divisors (4678699369).
52022334640631 is a wasteful number, since it uses less digits than its factorization.
52022334640631 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4678699368.
The product of its (nonzero) digits is 622080, while the sum is 41.
Adding to 52022334640631 its reverse (13604643322025), we get a palindrome (65626977962656).
The spelling of 52022334640631 in words is "fifty-two trillion, twenty-two billion, three hundred thirty-four million, six hundred forty thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.110 sec. • engine limits •