Base | Representation |
---|---|
bin | 101111000001001110011… |
… | …010101000010010100101 |
3 | 102102220010002001010122210 |
4 | 233001032122220102211 |
5 | 410414324014311323 |
6 | 10512205555114033 |
7 | 452304303266601 |
oct | 57011632502245 |
9 | 12386102033583 |
10 | 3231131010213 |
11 | 1036351246697 |
12 | 44226b2a2919 |
13 | 1a5904631882 |
14 | b255d714501 |
15 | 590b0c51293 |
hex | 2f04e6a84a5 |
3231131010213 has 16 divisors (see below), whose sum is σ = 4458100334400. Its totient is φ = 2079170110080.
The previous prime is 3231131010199. The next prime is 3231131010223. The reversal of 3231131010213 is 3120101311323.
It is a happy number.
It is not a de Polignac number, because 3231131010213 - 25 = 3231131010181 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 3231131010213.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3231131010223) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5414448 + ... + 5981513.
It is an arithmetic number, because the mean of its divisors is an integer number (278631270900).
Almost surely, 23231131010213 is an apocalyptic number.
It is an amenable number.
3231131010213 is a deficient number, since it is larger than the sum of its proper divisors (1226969324187).
3231131010213 is a wasteful number, since it uses less digits than its factorization.
3231131010213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11399252.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 3231131010213 its reverse (3120101311323), we get a palindrome (6351232321536).
The spelling of 3231131010213 in words is "three trillion, two hundred thirty-one billion, one hundred thirty-one million, ten thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •