Base | Representation |
---|---|
bin | 101110110111111010011… |
… | …000000101001010100001 |
3 | 102101221022011111010221020 |
4 | 232313322120011022201 |
5 | 410233334031340223 |
6 | 10503433414520053 |
7 | 451501426526550 |
oct | 56677230051241 |
9 | 12357264433836 |
10 | 3221131121313 |
11 | 103208a5a80a6 |
12 | 44033a366029 |
13 | 1a499c982b51 |
14 | b1c915bdd97 |
15 | 58bc7db61e3 |
hex | 2edfa6052a1 |
3221131121313 has 16 divisors (see below), whose sum is σ = 4908418439040. Its totient is φ = 1840635795456.
The previous prime is 3221131121303. The next prime is 3221131121321. The reversal of 3221131121313 is 3131211311223.
3221131121313 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 3221131121313 - 213 = 3221131113121 is a prime.
It is a super-2 number, since 2×32211311213132 (a number of 26 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (3221131121303) 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, 4709031 + ... + 5349507.
It is an arithmetic number, because the mean of its divisors is an integer number (306776152440).
Almost surely, 23221131121313 is an apocalyptic number.
It is an amenable number.
3221131121313 is a deficient number, since it is larger than the sum of its proper divisors (1687287317727).
3221131121313 is a wasteful number, since it uses less digits than its factorization.
3221131121313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 879976.
The product of its digits is 648, while the sum is 24.
Adding to 3221131121313 its reverse (3131211311223), we get a palindrome (6352342432536).
The spelling of 3221131121313 in words is "three trillion, two hundred twenty-one billion, one hundred thirty-one million, one hundred twenty-one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •