Base | Representation |
---|---|
bin | 101111001011010111100… |
… | …100100000100010111001 |
3 | 102110221020002101101222120 |
4 | 233023113210200202321 |
5 | 411104130113404423 |
6 | 10521210411111453 |
7 | 453141220265622 |
oct | 57132744404271 |
9 | 12427202341876 |
10 | 3242022013113 |
11 | 103aa2a9a8334 |
12 | 4443aa742589 |
13 | 1a694bab54a0 |
14 | b2cb3d30a49 |
15 | 594ebe5eee3 |
hex | 2f2d79208b9 |
3242022013113 has 32 divisors (see below), whose sum is σ = 4876964951040. Its totient is φ = 1900744296000.
The previous prime is 3242022013037. The next prime is 3242022013141. The reversal of 3242022013113 is 3113102202423.
3242022013113 is digitally balanced in base 2 and base 3, because in such bases it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 3242022013113 - 217 = 3242021882041 is a prime.
It is a super-3 number, since 3×32420220131133 (a number of 39 digits) contains 333 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (3242022013193) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 6974643 + ... + 7424936.
It is an arithmetic number, because the mean of its divisors is an integer number (152405154720).
Almost surely, 23242022013113 is an apocalyptic number.
It is an amenable number.
3242022013113 is a deficient number, since it is larger than the sum of its proper divisors (1634942937927).
3242022013113 is a wasteful number, since it uses less digits than its factorization.
3242022013113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14399869.
The product of its (nonzero) digits is 1728, while the sum is 24.
Adding to 3242022013113 its reverse (3113102202423), we get a palindrome (6355124215536).
The spelling of 3242022013113 in words is "three trillion, two hundred forty-two billion, twenty-two million, thirteen thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.123 sec. • engine limits •