Base | Representation |
---|---|
bin | 100101101001110011100101… |
… | …0101001101001010100010101 |
3 | 1121102200112012222211210220012 |
4 | 1023103213022221221110111 |
5 | 321402400041012324341 |
6 | 3132223423051050005 |
7 | 126522332545251230 |
oct | 11323471251512425 |
9 | 1542615188753805 |
10 | 331201213011221 |
11 | 9659271138a983 |
12 | 31191020140905 |
13 | 112a61a952a587 |
14 | 5bb031d466417 |
15 | 2845484a7e0eb |
hex | 12d39caa69515 |
331201213011221 has 8 divisors (see below), whose sum is σ = 378515805432384. Its totient is φ = 283886653944960.
The previous prime is 331201213011167. The next prime is 331201213011241. The reversal of 331201213011221 is 122110312102133.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 331201213011221 - 210 = 331201213010197 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (331201213011241) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 18848261 + ... + 31900773.
It is an arithmetic number, because the mean of its divisors is an integer number (47314475679048).
Almost surely, 2331201213011221 is an apocalyptic number.
It is an amenable number.
331201213011221 is a deficient number, since it is larger than the sum of its proper divisors (47314592421163).
331201213011221 is a wasteful number, since it uses less digits than its factorization.
331201213011221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16677451.
The product of its (nonzero) digits is 432, while the sum is 23.
Adding to 331201213011221 its reverse (122110312102133), we get a palindrome (453311525113354).
The spelling of 331201213011221 in words is "three hundred thirty-one trillion, two hundred one billion, two hundred thirteen million, eleven thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •