Base | Representation |
---|---|
bin | 100101101001111000001001… |
… | …0101010000011011001110101 |
3 | 1121102201110111211111211110211 |
4 | 1023103300102222003121311 |
5 | 321403030122304342323 |
6 | 3132232123220145421 |
7 | 126523130421011623 |
oct | 11323602252033165 |
9 | 1542643454454424 |
10 | 331211011012213 |
11 | 9659688a077062 |
12 | 31192ab5538271 |
13 | 112a70ab4108b7 |
14 | 5bb09ac846513 |
15 | 2845859d3a70d |
hex | 12d3c12a83675 |
331211011012213 has 32 divisors (see below), whose sum is σ = 358031778048000. Its totient is φ = 305429836885056.
The previous prime is 331211011012207. The next prime is 331211011012237. The reversal of 331211011012213 is 312210110112133.
It is a cyclic number.
It is not a de Polignac number, because 331211011012213 - 213 = 331211011004021 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (331211011012313) 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 31 ways as a sum of consecutive naturals, for example, 86069488 + ... + 89835286.
It is an arithmetic number, because the mean of its divisors is an integer number (11188493064000).
Almost surely, 2331211011012213 is an apocalyptic number.
It is an amenable number.
331211011012213 is a deficient number, since it is larger than the sum of its proper divisors (26820767035787).
331211011012213 is a wasteful number, since it uses less digits than its factorization.
331211011012213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3766561.
The product of its (nonzero) digits is 216, while the sum is 22.
Adding to 331211011012213 its reverse (312210110112133), we get a palindrome (643421121124346).
The spelling of 331211011012213 in words is "three hundred thirty-one trillion, two hundred eleven billion, eleven million, twelve thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •