Base | Representation |
---|---|
bin | 1110001100101001101001… |
… | …10000101001000111111011 |
3 | 11002112200212100012102112120 |
4 | 13012110310300221013323 |
5 | 13043011103111104321 |
6 | 150222421443012323 |
7 | 6401433355035252 |
oct | 706246460510773 |
9 | 132480770172476 |
10 | 31221002441211 |
11 | 9a47830a48080 |
12 | 3602a0a66a0a3 |
13 | 1456187cb4c5b |
14 | 79d166d81799 |
15 | 3921e3744ec6 |
hex | 1c6534c291fb |
31221002441211 has 64 divisors (see below), whose sum is σ = 46429413279744. Its totient is φ = 18501853593600.
The previous prime is 31221002441203. The next prime is 31221002441249. The reversal of 31221002441211 is 11214420012213.
It is not a de Polignac number, because 31221002441211 - 23 = 31221002441203 is a prime.
It is a super-3 number, since 3×312210024412113 (a number of 41 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not an unprimeable number, because it can be changed into a prime (31221002440211) 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 63 ways as a sum of consecutive naturals, for example, 552820071 + ... + 552876543.
It is an arithmetic number, because the mean of its divisors is an integer number (725459582496).
Almost surely, 231221002441211 is an apocalyptic number.
31221002441211 is a deficient number, since it is larger than the sum of its proper divisors (15208410838533).
31221002441211 is a wasteful number, since it uses less digits than its factorization.
31221002441211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 58164.
The product of its (nonzero) digits is 768, while the sum is 24.
Adding to 31221002441211 its reverse (11214420012213), we get a palindrome (42435422453424).
The spelling of 31221002441211 in words is "thirty-one trillion, two hundred twenty-one billion, two million, four hundred forty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •