Base | Representation |
---|---|
bin | 100011011000010111111100… |
… | …1011111111111000000101001 |
3 | 1111210220200201110221010012220 |
4 | 1012300233321133333000221 |
5 | 311242404134112242301 |
6 | 3021521214034224253 |
7 | 122360261512240530 |
oct | 10660577137770051 |
9 | 1453820643833186 |
10 | 311213221212201 |
11 | 90186871075a90 |
12 | 2aaa325a125089 |
13 | 10486385cc0109 |
14 | 56bcb2bd5d317 |
15 | 25ea584038936 |
hex | 11b0bf97ff029 |
311213221212201 has 32 divisors (see below), whose sum is σ = 517429609036800. Its totient is φ = 161641658825280.
The previous prime is 311213221212193. The next prime is 311213221212209. The reversal of 311213221212201 is 102212122312113.
It is an interprime number because it is at equal distance from previous prime (311213221212193) and next prime (311213221212209).
It is not a de Polignac number, because 311213221212201 - 23 = 311213221212193 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (311213221212209) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 113420491 + ... + 116131968.
It is an arithmetic number, because the mean of its divisors is an integer number (16169675282400).
Almost surely, 2311213221212201 is an apocalyptic number.
It is an amenable number.
311213221212201 is a deficient number, since it is larger than the sum of its proper divisors (206216387824599).
311213221212201 is a wasteful number, since it uses less digits than its factorization.
311213221212201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 229558349.
The product of its (nonzero) digits is 576, while the sum is 24.
Adding to 311213221212201 its reverse (102212122312113), we get a palindrome (413425343524314).
The spelling of 311213221212201 in words is "three hundred eleven trillion, two hundred thirteen billion, two hundred twenty-one million, two hundred twelve thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •