Base | Representation |
---|---|
bin | 10001101000000111111… |
… | …000011011100110111011 |
3 | 11021210121111010121202201 |
4 | 101220013320123212323 |
5 | 124321232112324011 |
6 | 2324245225411031 |
7 | 153341315465536 |
oct | 21500770334673 |
9 | 4253544117681 |
10 | 1211313011131 |
11 | 427795685873 |
12 | 176916339a77 |
13 | 8a2c3317432 |
14 | 428b0bd7a1d |
15 | 21797ea8cc1 |
hex | 11a07e1b9bb |
1211313011131 has 4 divisors (see below), whose sum is σ = 1214475708672. Its totient is φ = 1208150313592.
The previous prime is 1211313011071. The next prime is 1211313011141. The reversal of 1211313011131 is 1311103131121.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1211313011131 - 27 = 1211313011003 is a prime.
It is a super-2 number, since 2×12113130111312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1211313011099 and 1211313011108.
It is not an unprimeable number, because it can be changed into a prime (1211313011141) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1581348196 + ... + 1581348961.
It is an arithmetic number, because the mean of its divisors is an integer number (303618927168).
Almost surely, 21211313011131 is an apocalyptic number.
1211313011131 is a deficient number, since it is larger than the sum of its proper divisors (3162697541).
1211313011131 is an equidigital number, since it uses as much as digits as its factorization.
1211313011131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3162697540.
The product of its (nonzero) digits is 54, while the sum is 19.
Adding to 1211313011131 its reverse (1311103131121), we get a palindrome (2522416142252).
The spelling of 1211313011131 in words is "one trillion, two hundred eleven billion, three hundred thirteen million, eleven thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •