Base | Representation |
---|---|
bin | 110100100010111111101001… |
… | …111111110010111111000111 |
3 | 1010022021020211112022000222011 |
4 | 310202333221333302333013 |
5 | 220242343404131023421 |
6 | 2135303205252115051 |
7 | 66451441335515422 |
oct | 6442775177627707 |
9 | 1108236745260864 |
10 | 231103231111111 |
11 | 6770036a127a57 |
12 | 21b05430605a87 |
13 | 9bc4c30a18858 |
14 | 410d6556409b9 |
15 | 1bab7d33104e1 |
hex | d22fe9ff2fc7 |
231103231111111 has 4 divisors (see below), whose sum is σ = 231446623728592. Its totient is φ = 230759838493632.
The previous prime is 231103231111091. The next prime is 231103231111211. The reversal of 231103231111111 is 111111132301132.
It is a happy number.
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 231103231111111 - 241 = 228904207855559 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 (231103231111211) 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, 171696307731 + ... + 171696309076.
It is an arithmetic number, because the mean of its divisors is an integer number (57861655932148).
Almost surely, 2231103231111111 is an apocalyptic number.
231103231111111 is a deficient number, since it is larger than the sum of its proper divisors (343392617481).
231103231111111 is an equidigital number, since it uses as much as digits as its factorization.
231103231111111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 343392617480.
The product of its (nonzero) digits is 108, while the sum is 22.
Adding to 231103231111111 its reverse (111111132301132), we get a palindrome (342214363412243).
The spelling of 231103231111111 in words is "two hundred thirty-one trillion, one hundred three billion, two hundred thirty-one million, one hundred eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •